ME Test Series

Question

The height of a binary tree is defined as the number of nodes in the longest path form the root node to the leaf node. Let X be the height of complete binary tree with 256 nodes. The value of X will be ______.

Comments

Is this one correct$?$

Please explain take some example 

The height of a binary tree is defined as the number of nodes in the longest path from the root node to the leaf node. 

I have the problem with the above line?

 

---

Height is 2 acc to the problem here..

      O

   /      \

O         O

As two nodes are there in the longest path.

---

@MiNiPanda

thank you so much, now I understand.

Answer 1

@Shaik Masthan Sir, Can we do like this 

number of nodes will be 1,2,4,8,... at each level

now count them it will be 2^n-1

now check for what value of n it will result in >=256

for n=8 it is 255

for n=9 it is >=256

so the height of the tree will be 9.

Comments

Yes, this is the correct way to analysis this question...

Moreover no need to call me sir :)