+1 vote
in Data Structures & Algorithms I by (110k points)
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.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
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).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.