Full binary tree in binary tree data structure

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^h+1 – 1) nodes (internal + external).

• A full binary tree of height h has exactly 2^h leaves (external nodes).

• 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 Types of Binary Tree page

Go to Binary Tree page  

full binary tree, define full binary tree, example of full binary tree, how does full binary tree differ from other types of binary trees, differentiate between strict and full binary tree