MANIPULATING MULTIPLE STACKS WITH ORDERED-HEAP

A new method for manipulating multiple stacks based on dynamic data st ructure is proposed in this paper. A simple data structure called orde red-heap is developed, in which nodes are preserved as a heap, and kep t inorder traversal sequence remains unchanged. By employing ordered-h eap to a multiple-stacks environment, it is easy and efficient to simu ltaneously handle several variable-size stacks in a sequential memory area. Our experiments show that not only the total number of item move ments in the proposed method is much smaller than in the previous meth ods, but also the overhead for maintaining data structure in the propo sed method is kept within a reasonable range.