Full Binary Trees
What you'll learn: You'll discover what makes a binary tree "full" and how to calculate its node count using simple formulas.
What Is a Full Binary Tree?
A full binary tree (also called a strictly binary tree or 2-tree) is a special type of binary tree where every node has exactly 0 or 2 children — never just one child. Think of it like a family tree where every couple either has no children or exactly two children, with no single-child families allowed.
In a full binary tree:
- Leaf nodes have 0 children (they're endpoints)
- Internal nodes have exactly 2 children (they branch twice)
Visualizing Full Binary Trees
A ← 2 children
/ \
B C ← B: 2 children, C: 0 children (leaf)
/ \
D E ← Both leaves (0 children each)
This is full! Now compare to a non-full tree:
A
/ ← Only 1 child — NOT full!
B
/ \
D E
Key Properties and Formulas
Full binary trees have elegant mathematical relationships:
- If there are L leaves, there are L - 1 internal nodes
- Total nodes: n = 2L - 1
- If there are i internal nodes, there are i + 1 leaves
- Total nodes: n = 2i + 1
These formulas come from the "all-or-nothing" property: every internal node contributes exactly two children, creating a predictable structure.
Key Takeaway: A full binary tree ensures every node has either 0 or 2 children, never just one, leading to predictable node counts with simple formulas like n = 2L - 1.