Quick Facts
- A tree where each parent node has at most two child nodes.
- The first node is called the root node.
- Any nodes without child nodes are called leaf or terminal nodes.
- Each node stores a pointer to a left child, right child, and data.
- Sometimes nodes will also store a pointer to the parent node.
