CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search In computer science , a 2–3–4 tree (also called a 2–4 tree ) is a self-balancing data structure that is commonly used to implement dictionaries . [ citation needed ] The numbers mean a tree where 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; a 4-node has three data elements, and if internal has four child nodes. 2-node 3-node 4-node 2–3–4 trees are B-trees of order 4; [1] like B-trees in general, they can search, insert and delete in O (log n ) time. One property of a 2–3–4 tree is that all external nodes are at the same depth. 2–3–4 trees are an isometry of red–black trees , meaning...