Abstract
Recall from the previous chapter that for an ordered list object, a data element may be inserted into and deleted from any specified position in the list structure. That is, a general list object provides for random access of its data elements. This flexibility, however, is realized at the expense of having to either explicitly rearrange the data elements or maintain a potentially complicated data linking structure.
Keywords
Data Element Priority Queue Test Driver Member Function Request Queue
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
Copyright information
© Springer-Verlag New York, Inc. 1994