スプレー木
1. Splay treeA 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 nonrandom 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.
Read “Splay tree” on English Wikipedia
Read “スプレー木” on Japanese Wikipedia
Read “Splay tree” on DBpedia
Read “Splay tree” on English Wikipedia
Read “スプレー木” on Japanese Wikipedia
Read “Splay tree” on DBpedia
Discussions
Log in to talk about this word.