Binary Trees
Binary relation on nodes. (n, m) in RT means n is the parent of m and m is a child of n.
There is a designated node called the root.
Every other node has indegree 1.
Each node has outdegree 0, 1, or 2.
Each child is either a left child or a right child.
Each node has at most one left child and one right child.