Binary Trees

Binary Trees

Each node has two children - left and right.

Full Binary Tree

All of the nodes have either 0 or 2 children. In other terms, all nodes except the leaf nodes, have two children.

    1
   /  \
  2    3
 / \
4   5

Complete Binary Tree

If all its levels, except possibly the last level, have the maximum number of possible nodes, and all the nodes in the last level appear as far left as possible.

    1
   /  \
  2    3
 / \   /
4   5	6

Balanced Binary Tree

A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than one.