7 search results - page 1 / 2 » Inorder traversal of splay trees |
ENTCS
2002
13 years 4 months ago
2002
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
SIGMETRICS
2004
ACM
13 years 10 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree...
MPC
1992
Springer
13 years 8 months ago
1992
Springer
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
APLAS
2003
ACM
13 years 10 months ago
2003
ACM
Given the inorder and preorder traversal of a binary tree whose labels are all distinct, one can reconstruct the tree. This article examines two existing algorithms for rebuilding ...