## 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).

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

**********

Go to Binary Tree page

## No comments:

## Post a Comment