Binary Tree Properties

Binary Tree Properties

1.      In binary tree maximum number of nodes are 2^h – 1 where h is the height of the tree.

2.      In binary tree total number of leaf nodes are 2^{h -1}.

3.      In binary tree maximum number of node on each level 1 is 2¹.

4.      In complete binary tree total number of edges are 2^{(tn – 1)} where tn is number of leaf nodes.

5.      In a linked representation of binary tree, if total number of nodes are n then total null links are n + 1.

6.      A tree with n nodes has n – 1 edges or branches.