Trusted answers to developer questions
Trusted Answers to Developer Questions

Related Tags

data structures
data structures
tree

What is a 2-3-4 Tree?

Educative Answers Team

A 2-3-4 Tree is a multiway search tree. It’s a self-balancing tree; it’s always perfectly balanced with every leaf node at equal distance from the root node.

Other than the leaf node, every node can be one of three types:

  • 2-Node has two child nodes and one data element

  • 3-Node has three child nodes and two data elements

  • 4-Node has four child nodes and three data elements