Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Self-balancing_binary_search_tree> ?p ?o. }
Showing items 1 to 41 of
41
with 100 items per page.
- Self-balancing_binary_search_tree abstract "In computer science, a self-balancing (or height-balanced) binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.These structures provide efficient implementations for mutable ordered lists, and can be used for other abstract data structures such as associative arrays, priority queues and sets.".
- Self-balancing_binary_search_tree thumbnail Unbalanced_binary_tree.svg?width=300.
- Self-balancing_binary_search_tree wikiPageExternalLink adtinfo.org.
- Self-balancing_binary_search_tree wikiPageExternalLink heightBalancedTree.html.
- Self-balancing_binary_search_tree wikiPageID "378310".
- Self-balancing_binary_search_tree wikiPageRevisionID "599064713".
- Self-balancing_binary_search_tree hasPhotoCollection Self-balancing_binary_search_tree.
- Self-balancing_binary_search_tree subject Category:Binary_trees.
- Self-balancing_binary_search_tree subject Category:Soviet_inventions.
- Self-balancing_binary_search_tree subject Category:Trees_(data_structures).
- Self-balancing_binary_search_tree type BinaryTrees.
- Self-balancing_binary_search_tree type LivingThing100004258.
- Self-balancing_binary_search_tree type Object100002684.
- Self-balancing_binary_search_tree type Organism100004475.
- Self-balancing_binary_search_tree type PhysicalEntity100001930.
- Self-balancing_binary_search_tree type Plant100017222.
- Self-balancing_binary_search_tree type Tree113104059.
- Self-balancing_binary_search_tree type VascularPlant113083586.
- Self-balancing_binary_search_tree type Whole100003553.
- Self-balancing_binary_search_tree type WoodyPlant113103136.
- Self-balancing_binary_search_tree comment "In computer science, a self-balancing (or height-balanced) binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.These structures provide efficient implementations for mutable ordered lists, and can be used for other abstract data structures such as associative arrays, priority queues and sets.".
- Self-balancing_binary_search_tree label "Albero binario di ricerca bilanciato".
- Self-balancing_binary_search_tree label "Arbre équilibré".
- Self-balancing_binary_search_tree label "Balancierter Baum".
- Self-balancing_binary_search_tree label "Self-balancing binary search tree".
- Self-balancing_binary_search_tree label "Árbol binario de búsqueda auto-balanceable".
- Self-balancing_binary_search_tree label "平衡2分探索木".
- Self-balancing_binary_search_tree label "平衡树".
- Self-balancing_binary_search_tree sameAs Balancierter_Baum.
- Self-balancing_binary_search_tree sameAs Árbol_binario_de_búsqueda_auto-balanceable.
- Self-balancing_binary_search_tree sameAs Arbre_équilibré.
- Self-balancing_binary_search_tree sameAs Albero_binario_di_ricerca_bilanciato.
- Self-balancing_binary_search_tree sameAs 平衡2分探索木.
- Self-balancing_binary_search_tree sameAs 자가_균형_이진_탐색_트리.
- Self-balancing_binary_search_tree sameAs m.0218dt.
- Self-balancing_binary_search_tree sameAs Q245955.
- Self-balancing_binary_search_tree sameAs Q245955.
- Self-balancing_binary_search_tree sameAs Self-balancing_binary_search_tree.
- Self-balancing_binary_search_tree wasDerivedFrom Self-balancing_binary_search_tree?oldid=599064713.
- Self-balancing_binary_search_tree depiction Unbalanced_binary_tree.svg.
- Self-balancing_binary_search_tree isPrimaryTopicOf Self-balancing_binary_search_tree.