MIT's Introduction to Algorithms, Lectures 1 and 2: Analysis of Algorithms

You're viewing a comment by Abhijeet Singh and its responses.

Abhijeet Singh Permalink
June 20, 2010, 21:49

cn anyone tell me in l1 y the height of tree is logn??
cant figure it out....is it too obvious??

Reply to this comment

Comment Responses

Rahul Permalink
July 14, 2010, 10:19

well. if tree is complete binary tree, no of nodes in tree can be found using formula n = 2 pow h, where h is the height to tree.if u take log on both sides it comes out to log(n) = h log(2).
log(n) = h log(2) of log base 2
h = log(n).

but this is valid in case of complete binary tree.
i hope this solve your query.

Reply to this comment

Reply To This Comment

(why do I need your e-mail?)

(Your twitter name, if you have one. (I'm @pkrumins, btw.))

Comment Help

Type first 3 letters of your name: (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.