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...
A calculus for developing programs from specifications written as predicates that describe the relationship between the initial and final state is proposed. Such specifications are...