Question

Suppose a binary tree is constructed with any no such that each node has exactly other 02 children the maximum height of tree will be

Answer 1

Answer:

The relationship between number of nodes and depth when each node has 2 children is

${2}^{n} - 1$