Introduces stacks, queues, linked lists, trees, heaps ... Examines several design issues, including selection of data structures based on operations to be optimized, algorithm encapsulation using ...

Basic operations supported by the List ADT include: There are many kinds of data structures, ranging from single variables to arrays or linked lists ... implements Stack { Deque D; // holds ...