0Binary Tree - In a binary tree, every node except leaf node contains almost two children.
- if every internal node contains precisely two children, then it is called 2-array binary tree.
- leaves = Internal nodes (K_array-1) +1 : for binary tree K_array=2
Complete Binary tree - A binary tree where all levels are full except the last level, and it is filling from "Left to Right."
- Every full binary tree is a complete binary tree, but converse need not be true.
