2-3 tree

English

Noun

2-3 tree (plural 2-3 trees)

  1. (computing theory) A tree data structure whose every node with children (internal node) has either two children and one data element, or three children and two data elements; a B-tree of order 3.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.