Skip to content
Related Articles

Related Articles

Data Structures | Binary Trees | Question 4
  • Difficulty Level : Easy
  • Last Updated : 09 Oct, 2020

Level of a node is distance from root to that node. For example, level of root is 1 and levels of left and right children of root is 2. The maximum number of nodes on level i of a binary tree is



In the following answers, the operator ‘^’ indicates power.
(A) 2^(i-1)
(B) 2^i
(C) 2^(i+1)
(D) 2^[(i+1)/2]


Answer: (A)

Explanation: Number of nodes of binary tree will be maximum only when tree is full complete, therefore answer is 2^(i)-1
So, option (A) is true.

Quiz of this Question

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :