I have a basic understanding of how 2-3-4 trees maintain the height balance property operation after operation to make sure even the worst case operations are O(n logn).

But I do not understand it well enough to know why only 2-3-4?

Why not 2-3 or 2-3-4-5 etc?

algorithm data-structures tree b-tree 2-3-4-tree
Edit
Report