edited by
1,028 views

2 Answers

0 votes
0 votes

A splay tree is a self-balanced tree in which the last access key is always in the root.

The final tree looks like this:

Option B is correct.

How splay tree insertion is done here, please refer to Splay tree insertion

edited by

Related questions

2 votes
2 votes
2 answers
1
go_editor asked Mar 27, 2020
863 views
Which of the following is not collision resolution technique?Hash addressingChainingBoth (A) and (B)Indexing
1 votes
1 votes
3 answers
2
go_editor asked Mar 26, 2020
1,579 views
Suppose we are implementing quadratic probing with a Hash function, Hash $(y)=X$ mode $100$. If an element with key $4594$ is inserted and the first three locations attem...
1 votes
1 votes
1 answer
3
go_editor asked Mar 26, 2020
1,286 views
What operation is supported in constant time by the doubly linked list, but not by the singly linked list ?AdvanceBackupFirstRetrieve
0 votes
0 votes
2 answers
4
go_editor asked Mar 27, 2020
3,761 views
Code optimization is responsibility of :Application programmerSystem programmerOperating systemAll of the above