Elementary (Linear) ADTs
- 35 Downloads
In chapter 2 we defined an abstract data type as a model with a set of operations. We can broadly classify ADTs according to the structure of their models. The first class of ADTs includes those whose models have a linear structure. A linear structure is one in which each element (except the last) may have exactly one successor element and each element (except the first) one predecessor element. The ADT stack falls into this category. The model for a stack is a set of elements where the elements are time-stamped on their arrival into the set. According to the time-stamps, the elements can be organised into a linear structure. This is why there can be no more than one pair with similar time-stamps in a stack.
Unable to display preview. Download preview PDF.
Bibliographic Notes and Further Reading
- Aho, A. V., Hopcroft, J. E. and Ullman, J. D. (1983). Data Structures and Algorithms, Addison-Wesley, Reading, Massachusetts.Google Scholar
- Gotlieb, C. C. and Gotlieb, L. R. (1978). Data Types and Data Structures, Prentice-Hall, Englewood Cliffs, New Jersey.Google Scholar
- Knuth, D. E. (1973). The Art of Computer Programming. Volume 1: Fundamental Algorithms, 2nd edition, Addison-Wesley, Reading, Massachusetts.Google Scholar
- Queinnec, C. (1984). LISP, Macmillan, London.Google Scholar
- Stubbs, D. and Webre, N. (1985). Data Structures with Abstract Data Types and Pascal, Brooks/Cole Publishing, Monterey, California.Google Scholar