2–3 tree

2–3 tree

In computer science, a 2–3 tree is a tree data structure, 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. A 2–3 tree is a B-tree of order 3. Nodes on the outside of the tree (leaf nodes) 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 node contains the same or close to the same amount of data.
building
http://dbpedia.org/resource/2–3_tree
2-3 tree
Wikipage redirect
2–3_tree
primaryTopic

2–3 tree

In computer science, a 2–3 tree is a tree data structure, 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. A 2–3 tree is a B-tree of order 3. Nodes on the outside of the tree (leaf nodes) 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 node contains the same or close to the same amount of data.
building
http://dbpedia.org/resource/2–3_tree
has abstract
2-3 drzewo – struktura danych ...... * wierzchołek z 3 następnikami
@pl
2-3 strom je druh stromu, jeho ...... rom s prvky ve stejném pořadí.
@cs
2-3 дерево — структура данных, ...... ева. * 2-вершина * 3-вершина
@ru
2-3木（2-3き、英: 2-3 tree）とは計算機科学におけるデータ構造で特に（balanced tree）に属する木構造の一種である。
@ja
Em Ciência da Computação, uma ...... (chaves). * 2-node * 3-node
@pt
En las ciencias de la computac ...... tiempo logarítmico amortizado.
@es
In computer science, a 2–3 tre ...... se to the same amount of data.
@en
Un albero 2-3 è un tipo di str ...... no costo, nel caso peggiore, .
@it
计算机科学中，2–3树是一种树型数据结构，内部节点（存在子节 ...... 树，意味着右边，左边，中间的子树的元素数量都是相同或接近的。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
Link from a Wikipage to another Wikipage
delete avg
O
@en
delete worst
O
@en
insert avg
O
@en
insert worst
O
@en
invented by
invented year
name
search avg
O
@en
search worst
O
@en
space avg
O
@en
space worst
O
@en
type
tree
@en
wikiPageUsesTemplate
subject
hypernym
type
comment
2-3 drzewo – struktura danych ...... * wierzchołek z 3 następnikami
@pl
2-3 strom je druh stromu, jeho ...... e všechna data leží v listech.
@cs
2-3 дерево — структура данных, ...... ева. * 2-вершина * 3-вершина
@ru
2-3木（2-3き、英: 2-3 tree）とは計算機科学におけるデータ構造で特に（balanced tree）に属する木構造の一種である。
@ja
Em Ciência da Computação, uma ...... (chaves). * 2-node * 3-node
@pt
En las ciencias de la computac ...... tiempo logarítmico amortizado.
@es
In computer science, a 2–3 tre ...... se to the same amount of data.
@en
Un albero 2-3 è un tipo di str ...... no costo, nel caso peggiore, .
@it
计算机科学中，2–3树是一种树型数据结构，内部节点（存在子节 ...... 树，意味着右边，左边，中间的子树的元素数量都是相同或接近的。
@zh
label
2-3 drzewo
@pl
2-3 strom
@cs
2-3-дерево
@ru
2-3木
@ja
2-3树
@zh
2–3 tree
@en
Albero 2-3
@it
Árbol 2-3
@es
Árvore 2-3
@pt
sameAs
wasDerivedFrom
isPrimaryTopicOf