[工学]顺序表_堆栈和队列.ppt

Chapter 4Lists, Stacks, and Queues Lists Stacks Queues linear structure Lists Interface of The List Array-based List (Sequential List) Array-based List Implementation Array-based List Implementation(cont) Array-based List Implementation(cont) Array-based List Insert Array-based List Append Array-based List Remove Advantages and Disadvantages Singly Linked List Link Class Link Class(continue) Link Class(continue) Link Class(continue) Insert and Remove in Singly Linked List Linked List with Header Node The implement of some Operations The implement of some Operations The implement of some Operations Single Linked List Implementation Comparison of List Implementations Comparison of List Implementations（continue） Doubly Linked List DLink Class Doubly Linked List Implementation Insert and Remove in Doubly Linked List The implement of some Operations The implement of some Operations(continuous) Circular Linked List Stacks Stacks ADT Array-based Stacks Push, Pop and topValue Linked Stacks Examples of Stack Application Implementing Recursion Recursion Process Transform Recursion to Non_Recursion The Tower of Hanoi (recursion) The Tower of Hanoi (Non_recursion) Queues Array-based Queues Array-based Queues(continuous) Queues ADT enqueue, dequeue and isEmpty Linked Queues An Example of Queue Application An Example of Queue Application (continuous) Link the first node with last node. A circular singly linked list: a1 a2 an … head curr tail curr tail A circular singly linked list: B C D A head Stack --- a restricted list in which insertions and deletions are made at only one end. (Last - In - First - Out ( L I F O )) The end permitted to insert or remove element is called top, the another end is called bottom. stack S = (a0, …, an-1) a0 --- the bottom element an-1 --- the top element . A B C D Push Pop top bottom bool push(const Elem item){ if top = size return false; // Stack overflow listarray[top++] = item; return true; } bool pop(Ele it