Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Splay_tree> ?p ?o. }
Showing items 1 to 55 of
55
with 100 items per page.
- Splay_tree abstract "A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look-up and removal in O(log n) amortized time. For many sequences of non-random operations, splay trees perform better than other search trees, even when the specific pattern of the sequence is unknown. The splay tree was invented by Daniel Dominic Sleator and Robert Endre Tarjan in 1985.All normal operations on a binary search tree are combined with one basic operation, called splaying. Splaying the tree for a certain element rearranges the tree so that the element is placed at the root of the tree. One way to do this is to first perform a standard binary tree search for the element in question, and then use tree rotations in a specific fashion to bring the element to the top. Alternatively, a top-down algorithm can combine the search and the tree reorganization into a single phase.".
- Splay_tree wikiPageExternalLink 1003.0139.
- Splay_tree wikiPageExternalLink SplayTree.
- Splay_tree wikiPageExternalLink libtree.
- Splay_tree wikiPageExternalLink splay.
- Splay_tree wikiPageExternalLink splaying.
- Splay_tree wikiPageExternalLink splaytree.html.
- Splay_tree wikiPageExternalLink watch?v=G5QIXywcJlY.
- Splay_tree wikiPageID "28382".
- Splay_tree wikiPageRevisionID "602465513".
- Splay_tree deleteAvg "O".
- Splay_tree deleteWorst "amortized O".
- Splay_tree hasPhotoCollection Splay_tree.
- Splay_tree insertAvg "O".
- Splay_tree insertWorst "amortized O".
- Splay_tree inventedBy "Daniel Dominic Sleator and Robert Endre Tarjan".
- Splay_tree inventedYear "1985".
- Splay_tree name "Splay tree".
- Splay_tree searchAvg "O".
- Splay_tree searchWorst "amortized O".
- Splay_tree spaceAvg "O".
- Splay_tree spaceWorst "O".
- Splay_tree type "tree".
- Splay_tree subject Category:Binary_trees.
- Splay_tree type Abstraction100002137.
- Splay_tree type Arrangement105726596.
- Splay_tree type Cognition100023271.
- Splay_tree type DataStructure105728493.
- Splay_tree type PsychologicalFeature100023100.
- Splay_tree type Structure105726345.
- Splay_tree comment "A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look-up and removal in O(log n) amortized time. For many sequences of non-random operations, splay trees perform better than other search trees, even when the specific pattern of the sequence is unknown.".
- Splay_tree label "Albero splay".
- Splay_tree label "Arbre splay".
- Splay_tree label "Drzewo splay".
- Splay_tree label "Splay tree".
- Splay_tree label "Splay-Baum".
- Splay_tree label "Splayboom".
- Splay_tree label "Árbol biselado".
- Splay_tree label "Расширяющееся дерево".
- Splay_tree label "スプレー木".
- Splay_tree label "伸展树".
- Splay_tree sameAs Splay_strom.
- Splay_tree sameAs Splay-Baum.
- Splay_tree sameAs Árbol_biselado.
- Splay_tree sameAs Arbre_splay.
- Splay_tree sameAs Albero_splay.
- Splay_tree sameAs スプレー木.
- Splay_tree sameAs Splayboom.
- Splay_tree sameAs Drzewo_splay.
- Splay_tree sameAs m.070w4.
- Splay_tree sameAs Q80729.
- Splay_tree sameAs Q80729.
- Splay_tree sameAs Splay_tree.
- Splay_tree wasDerivedFrom Splay_tree?oldid=602465513.
- Splay_tree isPrimaryTopicOf Splay_tree.