Kerala PSC AP Exam

Question

In a binary tree, for every node the difference between the number of nodes in the left and right sub trees is atmost 2. If the height of the tree is h > 0  , then the minimum number of nodes in the tree is

A) 2 ^h-1

B) 2^h-1 +1

C) 2^h - 1

D) 2^h

Comments

https://gateoverflow.in/3811/gate2005-it_50