What item is at the root after the following sequence of insertions into an empty splay tree :
$1, 11, 3, 10, 8, 4, 6, 5, 7, 9, 2, ?$
Refer to this : https://stackoverflow.com/questions/11015357/splay-treewhat-item-is-at-the-root#_=_ . Clearly explained
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
64.3k questions
77.9k answers
244k comments
80.0k users