• A Tree is decomposed of subtree
  • In case of a linked list, for the depth of the list, you can’t get there lesser than O(n) time
  • However in a binary tree, you CAN get logarithmic complexity

Full Binary Tree

Complete & Incomplete Binary Tree