Ch03 LISTS STACKS QUEUES(数据结构).pptVIP

Introduce the concept of Abstract Data Types (ADTs). Show how to efficiently perform operations on lists. Introduce the stack ADT and its use in implementing recursion. Introduce the queue ADT and its use in operating systems and algorithm design. 3.3.2. Implementations Linked List Implementation of Stacks Struct Node; typedef struct Node *PtrToNode; typedef PtrToNode Stack; struct Node { ElementType Element; PtrToNode Next; }; /* Stack implementation will use a header. */ Figure 3.38 Type declaration for linked list implementation of the stack ADT int is_empty( Stack S