2-3-4 tree

2-3-4 tree (plural 2-3-4 trees)

1. (computing theory) A tree data structure whose every node with children (internal node) has either two, three or four child nodes: a 2-node has one data element, and if internal has two child nodes; a 3-node has two data elements, and if internal has three child nodes; and a 4-node has three data elements, and if internal has four child nodes.

   Synonym: 2-4 tree

• 2-3 tree