Question

The maximum number of nodes on level i of a binary tree is

• A. $\begin{array}{cc}2i-& 1\end{array}$
• B. $\begin{array}{cc}3i-& 1\end{array}$
• C. $\begin{array}{cc}i+& 1\end{array}$
• D. $2^{i+1}$

Answer 1

The correct option is A $\begin{array}{cc}2i-& 1\end{array}$

The maximum number of nodes in a binary tree of depth is 2 k − 1 , k ≥ 1

: if level is 3 then there will be maximum 7 nodes in the binary tree which is 2^3-1=8-1=7.

A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.