2-3-4 Trees

Overview

A 2-3-4 tree is a type of B tree which means it is a self-balancing data structure

These are some properties of 2-3-4 Trees:

• Each of the nodes can have 2, 3, or 4 children
• The child has n+1 of the parent
• When a root is full a preemptive root split occurs

Learn more about 2-3-4 Trees.