2-3-4 Tree

What is a 2-3-4 Tree?

A 2-3-4 Tree is a balanced search tree. Each node can have 2, 3, or 4 children. It keeps data organized and allows efficient searching, insertion, and deletion.

Main Features

• It is always balanced.
• Each node can store multiple values.
• Search and insertion are efficient.

Basic Insertion Steps

1. Start at the root.
2. Move to the correct child.
3. Split full nodes if needed.
4. Insert the value into a leaf.

Image of a 2-3-4 Tree

More information: Learn about 2-3-4 Tree