Data Structures — Trees- Part-2

Binary Trees

What is a Binary Tree ?

A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.

Binary Tree

Types of Binary Tree

1. Full Binary Tree

A full Binary tree is a special type of binary tree in which every parent node/internal node has either two or no children.

Full Binary Tree

2. Complete Binary Tree

A complete binary tree is just like a full binary tree, but with two major differences

1. Every level must be completely filled except the last one.
2. The last level has all the nodes as left as possible.

Complete Binary Tree

3.Perfect Binary Tree