Question

Minimum number of nodes required to make a complete binary tree of height h is

Answer 1

Explanation:

 binary search tree has height h, minimum number of nodes is n+1 (in case of left skewed and right skewed binary search tree). If binary search tree has height h, maximum number of nodes will be when all levels are completely full. Total number of nodes will be 2^0 + 2^1 + ….