Data Structures

A binary tree is full if each node has 0 or 2 children. We can also say that a full binary tree is a binary tree in which all the nodes, except the leaves, have two children. A binary tree is perfect if all the internal nodes have two children and all the leaves are on the same level.

A tree is an acyclic graph, a tree of which each vertex has at most 2 children is called a binary tree. Since each vertex of a binary tree can only have 2 children, we generally name them left child (under left tree) and right child (under right tree).

A graph G is represented by a pair (S, A) where S is a finite set and A a binary relation on S. The set S is the set of vertices of G and A is the set of arcs of G.