GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
132 views

asked in Algorithms by Boss (5.9k points)   | 132 views

1 Answer

+7 votes
Best answer

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}$ )

 

answered by Veteran (23.1k points)  
selected by


Top Users Jul 2017
  1. Bikram

    4062 Points

  2. manu00x

    2464 Points

  3. Debashish Deka

    1850 Points

  4. joshi_nitish

    1658 Points

  5. Arjun

    1294 Points

  6. Hemant Parihar

    1184 Points

  7. Arnab Bhadra

    1112 Points

  8. Shubhanshu

    1054 Points

  9. Ahwan

    900 Points

  10. rahul sharma 5

    706 Points


24,023 questions
30,966 answers
70,346 comments
29,342 users