Sciweavers

MPC
1992
Springer
235views Mathematics» more  MPC 1992»
13 years 9 months ago
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space
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...
Berry Schoenmakers