Implementation of Flexible Arrays Using Balanced Trees

Open Access

1 January 1991

journal article
Published by Oxford University Press (OUP) in The Computer Journal

Vol. 34 (5) , 386-396
https://doi.org/10.1093/comjnl/34.5.386

Abstract

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.

Keywords

USING BALANCED
BALANCED TREES
FLEXIBLE ARRAYS
ARRAYS USING
IMPLEMENTATION OF FLEXIBLE

This publication has 0 references indexed in Scilit: