Data Structures and Algorithms Stacks and Queues Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/23
6-0: Stacks and Queues Stacks and queues are two of the most common data structures Based on the List, but with more limited access to elements. Simplicity allows for efficiency, easy implementation. Department of Computer Science University of San Francisco p.2/23
6-1: Stack A Stack is a Last-In, First-Out (LIFO) data structure. Like a stack of trays in a cafeteria. Stack Operations: Add an element to the top of the stack (push) Remove the top element (pop) Look at the top element (peek) Check if the stack is empty Department of Computer Science University of San Francisco p.3/23
6-2: Uses of a stack Postfix notation calculator 3 4 + -> 7 3 4 + 5 - -> 2 Parenthesis checker Recursion Interrupt handling Department of Computer Science University of San Francisco p.4/23
6-3: Stack Implementation Array: Like the list, we allocate memory in advance. Keep a pointer for the top of the stack. Department of Computer Science University of San Francisco p.5/23
6-4: Stack Implementation Array: Stack elements are stored in an array Top of the stack is the end of the array If the top of the stack was the beginning of the array, a push or pop would require moving all elements in the array Push: data[top++] = elem Pop: elem = data[--top] Department of Computer Science University of San Francisco p.6/23
6-5: Θ() For Stack Operations Array Implementation: push pop empty() Department of Computer Science University of San Francisco p.7/23
6-6: Θ() For Stack Operations Array Implementation: push Θ(1) pop Θ(1) empty() Θ(1) Pros: fast, easy to implement Cons: Resizing the stack is Θ(n) Department of Computer Science University of San Francisco p.8/23
6-7: Stack Implementation Linked List: Department of Computer Science University of San Francisco p.9/23
6-8: Stack Implementation Linked List: Stack elements are stored in a linked list Top of the stack is the front of the linked list push: top = new Link(elem, top) pop: elem = top.element(); top = top.next() Department of Computer Science University of San Francisco p.10/23
6-9: Θ() For Stack Operations Linked List Implementation: push pop empty() Department of Computer Science University of San Francisco p.11/23
6-10: Θ() For Stack Operations Linked List Implementation: push Θ(1) pop Θ(1) empty() Θ(1) Pros: Fast, can grow/shrink dynamically, Cons: Allocating/freeing memory may be costly. Department of Computer Science University of San Francisco p.12/23
A Queue is a Last-In, First-Out (FIFO) data structure. Like a line at the post office or grocery store. Queue Operations: 6-11: Queue Add an element to the end (tail) of the Queue (enqueue) Remove an element from the front (head) of the Queue (dequeue) Check the item at the front of the queue (peek) Check if the Queue is empty Department of Computer Science University of San Francisco p.13/23
6-12: Uses of a queue Scheduling You ll get lots of experience with queues in OS Searching (web crawling) Handling requests Print queues Department of Computer Science University of San Francisco p.14/23
6-13: Queue Implementation Linked List: Department of Computer Science University of San Francisco p.15/23
6-14: Queue Implementation Linked List: Maintain a pointer to the first and last element in the Linked List Add elements to the back of the Linked List Remove elements from the front of the linked list Enqueue: tail.setnext(new link(elem,null)); tail = tail.next() Dequeue: elem = head.element(); head = head.next(); Department of Computer Science University of San Francisco p.16/23
6-15: Θ() For Queue Operations Linked List Implementation: enqueue Θ(1) dequeue Θ(1) empty() Θ(1) Pros: Fast, can grow/shrink dynamically, Cons: Allocating/freeing memory may be costly. Department of Computer Science University of San Francisco p.17/23
6-16: Queue Implementation Array: Can t just use a flat array, as with a stack. Queue will wind up sliding up the array. Department of Computer Science University of San Francisco p.18/23
6-17: Queue Implementation Array: Store queue elements in a circular array Maintain the index of the first element (head) and the next location to be inserted (tail) Enqueue: data[tail] = elem; tail = (tail + 1) % size Dequeue: elem = data[head]; head = (head + 1) % size Department of Computer Science University of San Francisco p.19/23
6-18: Queue Implementation Array Issues: What do head and tail look like when the queue is empty? What about when there is one element in the queue? What about when the queue is full? Department of Computer Science University of San Francisco p.20/23
6-19: Θ() For Queue Operations Array Implementation: enqueue Θ(1) dequeue Θ(1) empty() Θ(1) Pros: Fast Cons: Issues with full vs. empty, fixed size Department of Computer Science University of San Francisco p.21/23
6-20: Modifying Stacks Minimum Stacks have one additional operation: minimum: return the minimum value stored in the stack Can you implement a O(n) minimum? Department of Computer Science University of San Francisco p.22/23
6-21: Modifying Stacks Minimum Stacks have one additional operation: minimum: return the minimum value stored in the stack Can you implement a O(n) minimum? Can you implement a Θ(1) minimum? push, pop must remain Θ(1) as well! Department of Computer Science University of San Francisco p.23/23