## Full binary tree in binary tree data structure

##
**Full
binary tree**

A binary tree in which every node other than the leaves
has exactly two children is called full binary tree. It also referred as

**perfect binary tree**.

*Properties:*- A full binary tree of
**height h**has exactly**(2**(internal + external).^{h+1}– 1) nodes

- A full binary tree of
**height h**has exactly**2**(external nodes).^{h}leaves

- A full binary tree is also a strict binary tree.

The following figure shows some of the binary trees that are full binary trees;

Full binary trees. (a) and (b) are full binary tree. (c) is not full binary tree |

***********

Go to Binary Tree page