self doubt

Question

A weight-balanced tree is a binary tree in which for each node. 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 n nodes is best described by which of the following?

a)           

 b)                    

 c)                      

 d) 

Comments

https://gateoverflow.in/842/gate2002-2-12

Answer 1

answer will be floor(log₂n) .

for example let us consider number of nodes(n)=1 then height=log 1=0

n=2 then h=1

n=3 then h=1

n=4 then h=2

and so on.