2–3 tree
id:
2-3-tree-196-1305219
title:
2–3 tree
text:
In computer science, a 2–3 tree is a tree data structure, where every node with children has either two children (2-node) and one data element or three children (3-node) and two data elements. A 2–3 tree is a B-tree of order 3. Nodes on the outside of the tree have no children and one or two data elements. 2–3 trees were invented by John Hopcroft in 1970. 2–3 trees are required to be balanced, meaning that each leaf is at the same level. It follows that each right, center, and left subtree of a
brand slug:
wiki
category slug:
encyclopedia
description:
Data structure in computer science
original url:
https://en.wikipedia.org/wiki/2%E2%80%933_tree
date created:
date modified:
2024-04-15T13:49:19Z
main entity:
{"identifier":"Q169338","url":"https://www.wikidata.org/entity/Q169338"}
image:
fields total:
13
integrity:
14