Question

1a.
In 3 to 5 sentences, highlight what a splay tree is and how it works.

1b.
In natural language, describe how to carry out the following operations in a splay tree.
i. search ii. insert iii. delete

Answer 1

`Hey,

Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

A splay tree is just a binary search tree that has excellent performance in the cases where some data is accessed more frequently than others. The tree self-adjusts after lookup, insert and delete operations.

A splay tree does not necessarily have mininum height, nor does it necessarily have logarithmically bounded height. In fact a splay tree may even be degenerate. However, it is based on the idea that if you recently used something you'll likely need it again soon, so it keeps the most commonly used data near the top where it is accessed most quickly.

After each insert, delete, or lookup, you splay:

• The node you just looked up, or
• The node you just inserted, or
• The parent of the node you just deleted

Note: Brother According to HomeworkLib's policy we are only allowed to answer first part if there are many. So, I request you to post other part as separate posts

Kindly revert for any queries

Thanks.