Binary tree
It is classification of Tree in Data structure which has maximum of two child nodes.
Binary tree reprensentation
Binary search tree representation using linked list
Types of Binary search tree:
Full Binary Tree
2. Complete Binary Tree
3. Balanced Binary Tree
4. Perfect Binary Tree
5. Degenerate 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.
2)Complete Binary Tree
Every level of the tree except the last one is completely filled.
The last level of the tree should have all the keys as left as possible.
The absolute difference of heights of left and right subtrees at any node is less than 1.
For each node, its left subtree is a balanced binary tree.
For each node, its right subtree is a balanced binary tree.
4)Perfect binary tree
A Binary tree is Perfect Binary Tree in which all internal nodes have two children and all leaves are at same level.
5)Degenerate binary tree
The degenerate binary tree is a tree in which all the internal nodes have only one children.
