+1 vote
96 views

say n nodes are in binary tree.

1+2+3+4+...+i=n

(i*(i+1)) / 2 = n

i2=n

height is=O($\sqrt{n}$ )

selected
Total number of nodes n = 1 + 2 + 4 +... 2^(h-1) = 2^h - 1
n = 2^h - 1
h = lg (n+1)
h = O(lg n)
So A) is correct