Manipulating multiple stacks with ordered-heap

Chien Been-Chian, Yang Wei-Pang*, Rong-Jaye Chen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


A new method for manipulating multiple stacks based on dynamic data structure is proposed in this paper. A simple data structure called ordered-heap is developed, in which nodes are preserved as a heap, and kept inorder traversal sequence remains unchanged. By employing ordered-heap to a multiple-stacks environment, it is easy and efficient to simultaneously handle several variable-size stacks in a sequential memory area. Our experiments show that not only the total number of item movements in the proposed method is much smaller than in the previous methods, but also the overhead for maintaining data structure in the proposed method is kept within a reasonable range.

Original languageEnglish
Pages (from-to)207-224
Number of pages18
JournalInformation sciences
Issue number3
StatePublished - 15 Aug 1993

Fingerprint Dive into the research topics of 'Manipulating multiple stacks with ordered-heap'. Together they form a unique fingerprint.

Cite this