2 search results - page 1 / 1 » Inorder Traversal of a Binary Heap and its Inversion in Opti... |
MPC
1992
Springer
13 years 9 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...
ENTCS
2002
13 years 5 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...