First page Back Continue Last page Overview Graphics
Trees (cont’d)
Hierarchical structures are called trees
Binary trees
- Each node has no more than two children
- The beginning of the tree is a unique starting node called
the root
- The node to the left of a node, if it exists, is called its left child
- The node to the right of a node, if it exists, is its right child
- If a node in the tree has no children,
it is called a leaf node