Binary Trees

A binary tree is a data structure with the following properties.
- It is either empty or it has a root node.
- Each node in the binary tree may have up to two children (called left and right).
- Each node, except the root node, has exactly one parent. The root node has no parent.
Terminology
- The tree metaphor - tree, root, branch, leaf.
- The family metaphor - parent, child, sibling, ancestor, descendant.

This page was last modified on Apr 10, 2001

URL: http://people.hsc.edu/faculty-staff/robbk/Coms262/Lectures/BinaryTrees.html