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.
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
- Data Structures | Binary Trees | Question 15
- Data Structures | Binary Trees | Question 6
- Data Structures | Binary Search Trees | Question 4
- Data Structures | Binary Trees | Question 8
- Advantages of vector over array in C++
- Data Structures and Algorithms | Set 37
- Data Structures and Algorithms | Set 36
- Data Structures | Heap | Question 12
- Data Structures | Linked List | Question 17
- Data Structures | Balanced Binary Search Trees | Question 13