Vidyalelo
Data Structure · Q217

Binary Search Trees(B Tree)

Programming · Data Structure · question 217

Q217

Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as

A.
log2 n
B.
log4/3 n
C.
log3 n
D.
log3/2 n
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board