Binary Tree
A binary tree T is a finite set of nodes with the following properties:
1. Either the set is empty, T = O. or
2. The set consists of a root, r, and exactly two distinct binary trees T L and TR T = {r, TR, TL}.
TL is called the left subtree and TR is called the right subtree.