1.6 Abstract Data Types1.5.6 Keeping a List Sorted1 Algorithms and Data Structures in Java1.6.1 Interfaces

1.6 Abstract Data Types

Arrays and linked lists are data structures which can be used for the implementation of various kinds of  collections, i.e., objects that serve as repositories for other objects and provide access methods with particular properties. For instance, the previously presented collection class Table was implemented by an array (but could be also implemented by a linked list). We call such data structures with multiple implementation possibilities  abstract data types ( ADTs). In this section, we will discuss stacks and queues as two examples of abstract data types. However, first we are going to introduce another Java construct which becomes useful in this context.


© Wolfgang Schreiner; February 3, 2005

1.6 Abstract Data Types1.5.6 Keeping a List Sorted1 Algorithms and Data Structures in Java1.6.1 Interfaces