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

asked in Algorithms by Boss (6.3k points)   | 159 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 (24.1k points)  
selected by


Top Users Sep 2017
  1. Habibkhan

    8796 Points

  2. rishu_darkshadow

    3572 Points

  3. Warrior

    2914 Points

  4. Arjun

    2840 Points

  5. A_i_$_h

    2550 Points

  6. manu00x

    2268 Points

  7. nikunj

    1990 Points

  8. Bikram

    1874 Points

  9. makhdoom ghaya

    1820 Points

  10. SiddharthMahapatra

    1718 Points


26,346 questions
33,927 answers
80,524 comments
31,231 users