In computer science, a 2–3–4 tree is a self-balancing data structure that can be used to implement dictionaries. Wikipedia