出典:Wiktionary
出典:Wikipedia
出典:『Wikipedia』 (2011/06/30 17:29 UTC 版)
A 2-3 tree in computer science is a type of data structure, a tree where every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements. Nodes on the outside of the tree (leaf nodes) have no children and one or two data elements.