Binary Tree

What is Binary Tree

  • A tree is called as binary tree if each node has zero, one or two child.
  • It is a family of Data Structure(BST, Heap tree, AVL, Red-Black, Syntax tree, Huffman Coding tree, etc.)



Why should we learn Binary tree

  • Prerequisite for more advanced trees
  • Is used in solving specific problems like:
    • Huffman Coding
    • Heap(Priority Queue)
    • Expression parsing



Types of Binary Tree

  • Strict Binary Tree : if each node has either 2 children or none.
  • Full Binary Tree : if each non leaf node has 2 children and all lead nodes are at same level
  • Complete Binary Tree : if all levels are completely filled except possibly the last level and the last level has all keys as left as possible



Tree Representation

  • Using Linked List
  • Using Array