A 2-3-4 Tree is a self-balancing data structure that is a type of B-tree of order 4.
Each node can contain 1, 2, or 3 keys and have 2, 3, or 4 children respectively.
Key Properties
All leaves are at the same depth.
Nodes can contain multiple keys (1–3 keys per node).
Maintains sorted order of keys for efficient search, insertion, and deletion.
Insertion Steps
Start at the root and find the correct leaf for the new key.
Split any full nodes (nodes with 3 keys) encountered along the path.
