The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
179 views

asked in Algorithms by Boss (6.5k points) | 179 views

1 Answer

+8 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 (25.8k points)
selected by


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,834 questions
36,688 answers
90,626 comments
34,641 users