Data Structures and Algorithms (DSA) using C# .NET Core — Binary Trees and Binary Tree Types — II

In this story we will continue on Binary Trees and type of Binary Trees. Further we will talk about Binary Search Tree ( implementation of Binary Tree).

As mentioned in Article 1 A binary tree is a tree where each node can have no more than two children’s (i.e. 0, 1 or at max 2 children’s). Fig. 1

Fig. 31— Binary Tree Structure.

Each Binary tree has following properties:

1. Every node in a binary tree has at most two children i.e. every node has 0, 1 or 2 children. It cannot have more than two children.
2. Every child node is labeled as left child and/or right child.
3. Left child precedes right child in order of children.

Lets talk about Type of Binary Trees:

Types of Binary Trees:

1. Full Binary Tree ( proper Binary Tree)
2. Perfect Binary Tree
3. Complete Binary Tree
4. Balanced Binary Tree
5. Skewed Binary Tree
6. Degenerate Binary Tree

Full Binary Tree: A full Binary tree is a special type of binary tree where each parent / internal node has 2 or no…