2 - 3- 4 trees
A self balancing data structure in the form of a tree
Key features
Each node can have upto 2, 3, or 4 children
Always balanced for efficient operation.
used in B-Trees
Diagram
