GfG QA is closing soon... Please refer PRACTICE or GfG now on wards !!

What are the minimum number of node a binary tree can have of h - height ?

asked Apr 22, 2016 by no3

2 Answers

In worst case you can have only one children at each node, in that case you will have your binary tree structure similar to a list and at each level you will be having a single node, so if height of tree is h then in total you will have h node only as minimum number of node of binary tree.

such structure will look like this :

4
 \ 
  3
   \ 
    1

answered Apr 22, 2016 by utkarsh111

Minimum number of nodes in BINARY tree with height 'h' = (h+1)
e.g. Height 0 : only root = 1

Height 1 : root and one of its child = 2, and so forth.

answered Apr 23, 2016 by Rakesh Sharad Navale
...