Which of the following is the self-adjusting binary search tree?

› Category: Questions › Which of the following is the self-adjusting binary search tree?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

Which of the following is the self-adjusting binary search tree?
 
(a) AVL Tree
 
(b) Splay Tree
 
(c) Top Tree
 
(d) Ternary Tree
 
My question is taken from Binary Trees in portion Binary Trees of Data Structures & Algorithms I
 
I had been asked this question during an online exam.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months ago

Correct option is (b) Splay Tree
 
Best explanation: Splay tree is a self – adjusting binary search tree. It performs basic operations on the tree like insertion, deletion, loop up performing all these operations in O (log n) time.


Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40702

Related Posts