Scribd
Upload
18 views

Properties and Types of Binary Tree

DSA

Uploaded by

perewa7600
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

Properties and Types of Binary Tree

DSA

Uploaded by

perewa7600
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Properties of Binary Tree

o At each level of i, the maximum number of nodes is 2i.


o The height of the tree is defined as the longest path from the root node to
the leaf node. The tree which is shown above has a height equal to 3.
Therefore, the maximum number of nodes at height 3 is equal to (1+2+4+8)
= 15. In general, the maximum number of nodes possible at height h is
(20 + 21 + 22+….2h) = 2h+1 -1.
o The minimum number of nodes possible at height h is equal to h+1.
o If the number of nodes is minimum, then the height of the tree would be
maximum. Conversely, if the number of nodes is maximum, then the height
of the tree would be minimum.

If there are 'n' number of nodes in the binary tree.

The minimum height can be computed as:

As we know that,

n = 2h+1 -1

n+1 = 2h+1

Taking log on both the sides,

log2(n+1) = log2(2h+1)

log2(n+1) = h+1

h = log2(n+1) - 1

The maximum height can be computed as:

As we know that,

n = h+1

h= n-1
Types of Binary Tree

There are four types of Binary tree:

o Full/ proper/ strict Binary tree


o Complete Binary tree
o Perfect Binary tree
o Degenerate Binary tree
o Balanced Binary tree

1. Full/ proper/ strict Binary tree

o The full binary tree is also known as a strict binary tree. The tree can only
be considered as the full binary tree if each node must contain either 0 or 2
children. The full binary tree can also be defined as the tree in which each
node must contain 2 children except the leaf nodes.

Let's look at the simple example of the Full Binary tree.

In the above tree, we can observe that each node is either containing zero or two
children; therefore, it is a Full Binary tree.

Properties of Full Binary Tree

o The number of leaf nodes is equal to the number of internal nodes plus 1.
In the above example, the number of internal nodes is 5; therefore, the
number of leaf nodes is equal to 6.
o The maximum number of nodes is the same as the number of nodes in the
binary tree, i.e., 2h+1 -1.
o The minimum number of nodes in the full binary tree is 2*h-1.
o The minimum height of the full binary tree is log2(n+1) - 1.
o The maximum height of the full binary tree can be computed as:

n= 2*h - 1

n+1 = 2*h

h = n+1/2

Complete Binary Tree

The complete binary tree is a tree in which all the nodes are completely filled
except the last level. In the last level, all the nodes must be as left as possible. In
a complete binary tree, the nodes should be added from the left.

Let's create a complete binary tree.

The above tree is a complete binary tree because all the nodes are completely
filled, and all the nodes in the last level are added at the left first.

Properties of Complete Binary Tree


o The maximum number of nodes in complete binary tree is 2h+1 - 1.
o The minimum number of nodes in complete binary tree is 2h.
o The minimum height of a complete binary tree is log2(n+1) - 1.
o The maximum height of a complete binary tree is

Perfect Binary Tree

A tree is a perfect binary tree if all the internal nodes have 2 children, and all the
leaf nodes are at the same level.

Let's look at a simple example of a perfect binary tree.

The below tree is not a perfect binary tree because all the leaf nodes are not at the
same level.
Degenerate Binary Tree

The degenerate binary tree is a tree in which all the internal nodes have only one
child.

Let's understand the Degenerate binary tree through examples.


The above tree is a degenerate binary tree because all the nodes have only one
child. It is also known as a right-skewed tree as all the nodes have a right child
only.
The above tree is also a degenerate binary tree because all the nodes have only
one child. It is also known as a left-skewed tree as all the nodes have a left child
only.

Balanced Binary Tree

The balanced binary tree is a tree in which both the left and right trees differ by
atmost 1. For example, AVL and Red-Black trees are balanced binary tree.

Let's understand the balanced binary tree through examples.


The above tree is a balanced binary tree because the difference between the left
subtree and right subtree is zero.

The above tree is not a balanced binary tree because the difference between the
left subtree and the right subtree is greater than 1.
Almost Complete Binary Tree-

An almost complete binary tree is a binary tree that satisfies the following 2
properties-
• Allthe levels are completely filled except possibly the last level.
• The last level must be strictly filled from left to right.

Example-

Here,
• Firstbinary tree is not an almost complete binary tree.
• This is because the last level is not filled from left to right.

You might also like