Complete binary tree in binary tree data structures

Complete binary tree in binary tree data structures

Complete binary tree

A binary tree in which all the levels except the last one are completely filled with nodes and the last level is filled with nodes from left to right.

Properties:

• A complete binary tree is full and strict binary tree up to level h-1.

• A complete but non-strict binary tree with n leaves has 2n nodes (internal + external).

• A complete strict binary tree with n leaves has 2n-1 nodes (internal + external).

The following figure shows binary trees that are complete and not complete.

Complete binary trees. (e) is not complete binary tree

 **********

Go to Types of Binary Tree page

Go to Binary Tree page  

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