Why the height of a binary tree is 0(log(n))

Question

4.00/5 (1 vote)

See more:

Hey I am having difficulty to understand why the height of a binary tree is log(n).
I have seen it in many sorting algorithms and still i cannot understand logicly why its log(n).
Can please someone explain it.

Posted 3-Nov-12 0:22am

missak boyajian

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Thomas Daniels · Accepted Answer · 2012-11-03T00:24:00

Solution 1

Hi,

Read this:
http://www.cs.cmu.edu/~adamchik/15-121/lectures/Trees/trees.html[^]

Posted 3-Nov-12 0:24am

Thomas Daniels

Comments

Sergey Alexandrovich Kryukov 3-Nov-12 20:00pm

Actually, it explains the fact, looks like. A 5.
--SA