a node (called the root node) and; left and right sub-trees. Both the sub-trees are themselves binary trees. You now have a recursively defined data structure.
www.cs.auckland.ac.nz