DMCA
Self-adjusting binary search trees (1985)
Cached
Download Links
| Citations: | 431 - 18 self |
BibTeX
@MISC{Sleator85self-adjustingbinary,
author = {Daniel Dominic Sleator and Robert Endre Tarjan},
title = { Self-adjusting binary search trees},
year = {1985}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n-node splay tree, all the standard search tree operations have an amortized time bound of O(log n) per operation, where by “amortized time ” is meant the time per operation averaged over a worst-case sequence of operations. Thus splay trees are as efficient as balanced trees when total running time is the measure of interest. In addition, for sufficiently long access sequences, splay trees are as efficient, to within a constant factor, as static optimum search trees. The efftciency of splay trees comes not from an explicit structural constraint, as with balanced trees, but from applying a simple restructuring heuristic, called splaying, whenever the tree is accessed. Extensions of splaying give simplified forms of two other data structures: lexicographic or multidimensional search trees and link/ cut trees.
Keyphrases
splay tree self-adjusting binary search tree data structure binary search tree balanced tree total running time multidimensional search tree explicit structural constraint simple restructuring amortized time bound amortized time cut tree standard search tree operation static optimum search tree constant factor self-adjusting form long access sequence thus splay tree n-node splay tree worst-case sequence
