Dynamic Data Structures

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 a... View More