** Full Tree **: A binary tree where every node has 0 or 2 children.

** Complete Tree:** If all levels are completely filled except possibly the last level and the last level has all keys as left as possible.

** Perfect Tree: **If all internal nodes have two children and all leaves are at same level.