Abstract
In previous chapters, we have seen lists implemented using consecutive entries in an array. There are three problems with this. Firstly, if items are deleted from the middle of the list, all following items must be moved up to fill the gap. Secondly, if the items are held in a specified order, the addition of a new item to the middle of the list also requires other items to be moved. The third problem is that the size of the array limits the size of the list.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Copyright information
© 1991 Carl Bamford and Paul Curran
About this chapter
Cite this chapter
Bamford, C., Curran, P. (1991). Dynamic Data Structures. In: Data Structures, Files and Databases. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-12615-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-349-12615-6_4
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-56043-3
Online ISBN: 978-1-349-12615-6
eBook Packages: EngineeringEngineering (R0)