Skip Navigation

The Computer Journal 1991 34(5):386-396; doi:10.1093/comjnl/34.5.386
© 1991 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Challab, D. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Implementation of Flexible Arrays Using Balanced Trees

D. J. Challab *

Department of Computer Science, University of Reading, Whiteknights, Reading RG6 2AX, UK

A method of implementing single-ended flexible arrays (stacks) – using a 2-3 tree is studied. This is a step towards studying the possible alternative of using B-trees for allocation within flexible indexible arrays. Two different variants were presented, one using ‘single-heap’ and the other ‘separate heaps’ for 2-nodes and 3-nodes. Algorithms are derived for extending and popping an element from a 2-3 tree.

Received September 1987. revised April 1991.

* Department of Computer Science, University of Reading, Whiteknights, Reading RG6 2AX


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.