Register

splay tree insertion

1,118 views
1 1 vote
What item is at root after the following sequence of insertions into an empty splay tree

1,11,3,10,8, 4,6,5,7,9,2

A)1   B)2   C) 4    D)8

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · merge sortNext → · [Engineering Maths] ...
← Previous in category · let us cNext in category → · SSelf
Position:
Show:

Related questions

4 4 votes
1 answers 1 answer
1.7k
1.7k views
shivani2010 asked Jun 9, 2016
1,683 views
Splay Tree
The amortized time complexity to perform ______ operation(s) in Splay trees is $O(\log n)$.SearchSearch and Insert Search and DeleteSearch, insert and delete
3 3 votes
0 0 answers
932
932 views
V Y asked Nov 26, 2015
932 views
Total running time of 'm' access operation in a Splay tree .. [GATEFORUM-TEST-DSA]
2 2 votes
2 answers 2 answers
1.2k
1.2k views
Mradul_Bhardwaj asked Jan 28, 2025
1,151 views
Binary Search Tree insertion sequences
Suppose we want to create binary search using the key values12,26,10,27,20, 15,42), how many insertion sequence exits so that above tree can beconstructed?
1 1 vote
0 0 answers
481
481 views
Dharmik_24 asked Sep 15, 2024
481 views
#B-Tree Insertion
Generally in B-Tree insertion we are doing Node splitting(if a node has more than max keys than its median element goes up and splits the tree)In the example 11 is insert...