9.1 2-4 Trees

A 2-4 tree is a rooted tree with the following properties:

Property 9..1 (height)   All leaves have the same depth.

Property 9..2 (degree)   Every internal node has 2, 3, or 4 children.

An example of a 2-4 tree is shown in Figure 9.1.
Figure 9.1: A 2-4 tree of height 3.
The properties of 2-4 trees imply that their height is logarithmic in the number of leaves:

Lemma 9..1   A 2-4 tree with $ \mathtt{n}$ leaves has height at most $ \log \ensuremath{\mathtt{n}}$.

Proof. The lower-bound of 2 on the number of children of an internal node implies that, if the height of a 2-4 tree is $ h$, then it has at least $ 2^h$ leaves. In other words,

$\displaystyle \ensuremath{\mathtt{n}} \ge 2^h \enspace .

Taking logarithms on both sides of this inequality gives $ h \le \log \ensuremath{\mathtt{n}}$. $ \qedsymbol$

9.1.1 Adding a Leaf

Adding a leaf to a 2-4 tree is easy (see Figure 9.2). If we want to add a leaf $ \mathtt{u}$ as the child of some node $ \mathtt{w}$ on the second-last level, we simply make $ \mathtt{u}$ a child of $ \mathtt{w}$. This certainly maintains the height property, but could violate the degree property; if $ \mathtt{w}$ had 4 children prior to adding $ \mathtt{u}$, then $ \mathtt{w}$ now has 5 children. In this case, we split $ \mathtt{w}$ into two nodes, $ \mathtt{w}$ and $ \mathtt{w}$', having 2 and 3 children, respectively. But now $ \mathtt{w}$' has no parent, so we recursively make $ \mathtt{w}$' a child of $ \mathtt{w}$'s parent. Again, this may cause $ \mathtt{w}$'s parent to have too many children in which case we split it. This process goes on until we reach a node that has fewer than 4 children, or until we split the root, $ \mathtt{r}$, into two nodes $ \mathtt{r}$ and $ \mathtt{r'}$. In the latter case, we make a new root that has $ \mathtt{r}$ and $ \mathtt{r'}$ as children. This simultaneously increases the depth of all leaves and so maintains the height property.

Figure 9.2: Adding a leaf to a 2-4 Tree. This process stops after one split because $ \mathtt{w.parent}$ has degree less than 4 before the addition.

Since the height of the 2-4 tree is never more than $ \log \ensuremath{\mathtt{n}}$, the process of adding a leaf finishes after at most $ \log \ensuremath{\mathtt{n}}$ steps.

9.1.2 Removing a Leaf

Removing a leaf from a 2-4 tree is a little more tricky (see Figure 9.3). To remove a leaf $ \mathtt{u}$ from its parent $ \mathtt{w}$, we just remove it. If $ \mathtt{w}$ had only two children prior to the removal of $ \mathtt{u}$, then $ \mathtt{w}$ is left with only one child and violates the degree property.

Figure 9.3: Removing a leaf from a 2-4 Tree. This process goes all the way to the root because all of $ \mathtt{u}$'s ancestors and their siblings have degree 2.

To correct this, we look at $ \mathtt{w}$'s sibling, $ \mathtt{w'}$. The node $ \mathtt{w'}$ is sure to exist since $ \mathtt{w}$'s parent has at least 2 children. If $ \mathtt{w'}$ has 3 or 4 children, then we take one of these children from $ \mathtt{w'}$ and give it to $ \mathtt{w}$. Now $ \mathtt{w}$ has 2 children and $ \mathtt{w'}$ has 2 or 3 children and we are done.

On the other hand, if $ \mathtt{w'}$ has only two children, then we merge $ \mathtt{w}$ and $ \mathtt{w'}$ into a single node, $ \mathtt{w}$, that has 3 children. Next we recursively remove $ \mathtt{w'}$ from the parent of $ \mathtt{w'}$. This process ends when we reach a node, $ \mathtt{u}$, where $ \mathtt{u}$ or its sibling has more than 2 children; or we reach the root. In the latter case, if the root is left with only 1 child, then we delete the root and make its child the new root. Again, this simultaneously decreases the height of every leaf and therefore maintains the height property.

Again, since the height of the tree is never more than $ \log \ensuremath{\mathtt{n}}$, the process of removing a leaf finishes after at most $ \log \ensuremath{\mathtt{n}}$ steps.