The minimum height of self balancing binary search tree with n nodes is _____

› Category: Questions › The minimum height of self balancing binary search tree with n nodes is _____
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

The minimum height of self balancing binary search tree with n nodes is _____
 
(a) log2(n)
 
(b) n
 
(c) 2n + 1
 
(d) 2n – 1
 
My question is from Binary Trees topic in portion Binary Trees of Data Structures & Algorithms I
 
This question was posed to me in homework.

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

Right option is (a) log2(n)
 
Explanation: Self – balancing binary trees adjust the height by performing transformations on the tree at key insertion times, in order to keep the height proportional to log2(n).


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: 40701

Related Posts