Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/2–3_tree> ?p ?o }
Showing triples 1 to 72 of
72
with 100 triples per page.
- 2–3_tree abstract "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. 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.\t\t2–3 trees are an isometry of AA trees, meaning that they are equivalent data structures. In other words, for every 2–3 tree, there exists at least one AA tree with data elements in the same order. 2–3 trees are balanced, meaning that each right, center, and left subtree contains the same or close to the same amount of data.".
- 2–3_tree wikiPageExternalLink tttree.py.
- 2–3_tree wikiPageExternalLink data-structures-2-3-tree.html.
- 2–3_tree wikiPageExternalLink twothree.htm.
- 2–3_tree wikiPageExternalLink TwoThreeTree.html.
- 2–3_tree wikiPageID "647196".
- 2–3_tree wikiPageLength "6147".
- 2–3_tree wikiPageOutDegree "18".
- 2–3_tree wikiPageRevisionID "707654808".
- 2–3_tree wikiPageWikiLink (a,b)-tree.
- 2–3_tree wikiPageWikiLink 2–3_heap.
- 2–3_tree wikiPageWikiLink 2–3–4_tree.
- 2–3_tree wikiPageWikiLink AA_tree.
- 2–3_tree wikiPageWikiLink Binary_search_tree.
- 2–3_tree wikiPageWikiLink Category:B-tree.
- 2–3_tree wikiPageWikiLink Computer_science.
- 2–3_tree wikiPageWikiLink Data_element.
- 2–3_tree wikiPageWikiLink Finger_tree.
- 2–3_tree wikiPageWikiLink Isometry.
- 2–3_tree wikiPageWikiLink John_Hopcroft.
- 2–3_tree wikiPageWikiLink Node_(computer_science).
- 2–3_tree wikiPageWikiLink Tree_(data_structure).
- 2–3_tree wikiPageWikiLink File:2-3_insertion.svg.
- 2–3_tree wikiPageWikiLinkText "2-3 Tree".
- 2–3_tree wikiPageWikiLinkText "2–3 finger trees".
- 2–3_tree wikiPageWikiLinkText "2–3 tree".
- 2–3_tree deleteAvg "O".
- 2–3_tree deleteWorst "O".
- 2–3_tree insertAvg "O".
- 2–3_tree insertWorst "O".
- 2–3_tree inventedBy John_Hopcroft.
- 2–3_tree inventedYear "1970".
- 2–3_tree name "2".
- 2–3_tree searchAvg "O".
- 2–3_tree searchWorst "O".
- 2–3_tree spaceAvg "O".
- 2–3_tree spaceWorst "O".
- 2–3_tree type "tree".
- 2–3_tree wikiPageUsesTemplate Template:CS-Trees.
- 2–3_tree wikiPageUsesTemplate Template:Clear.
- 2–3_tree wikiPageUsesTemplate Template:Compu-prog-stub.
- 2–3_tree wikiPageUsesTemplate Template:Data_structures.
- 2–3_tree wikiPageUsesTemplate Template:Infobox_data_structure.
- 2–3_tree wikiPageUsesTemplate Template:Math.
- 2–3_tree wikiPageUsesTemplate Template:Mvar.
- 2–3_tree wikiPageUsesTemplate Template:Portal.
- 2–3_tree wikiPageUsesTemplate Template:Reflist.
- 2–3_tree subject Category:B-tree.
- 2–3_tree hypernym Structure.
- 2–3_tree type Building.
- 2–3_tree type Technique.
- 2–3_tree comment "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. 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.\t\t2–3 trees are an isometry of AA trees, meaning that they are equivalent data structures.".
- 2–3_tree label "2–3 tree".
- 2–3_tree sameAs Q169338.
- 2–3_tree sameAs 2-3_strom.
- 2–3_tree sameAs Árbol_2-3.
- 2–3_tree sameAs درخت_۲–۳.
- 2–3_tree sameAs עץ_2-3.
- 2–3_tree sameAs 2-3_fa.
- 2–3_tree sameAs Albero_2-3.
- 2–3_tree sameAs 2-3木.
- 2–3_tree sameAs Arbor_2-3.
- 2–3_tree sameAs Pepohon_2-3.
- 2–3_tree sameAs 2-3_drzewo.
- 2–3_tree sameAs Árvore_2-3.
- 2–3_tree sameAs m.02_8j_.
- 2–3_tree sameAs 2-3-дерево.
- 2–3_tree sameAs 2-3_stablo.
- 2–3_tree sameAs Q169338.
- 2–3_tree sameAs 2-3树.
- 2–3_tree wasDerivedFrom 2–3_tree?oldid=707654808.
- 2–3_tree isPrimaryTopicOf 2–3_tree.