CS350: Data Structures Stacks

Transcription

1 Stacks James Moscola Department of Engineering & Computer Science York College of Pennsylvania James Moscola

2 Stacks Stacks are a very common data structure that can be used for a variety of data storage purposes Similar to a stack of papers sitting on a table... - Items can be placed on the stack of papers - You can take a look at whats on the top of your stack of papers - Items can be removed from the top of your stack of papers - If you want a paper in the middle of the stack, you must remove the papers on top to get to the paper in the middle May also be referred to as a LIFO (Last-In-First-Out) 2

3 Stack Operations Stacks have three main operations - push - puts an element on the top of the stack - pop - removes a single element from the top of the stack - top or peek - returns the value of the element on the top of the stack (without removing it) 3

4 Stack Operations Start with Empty Stack Top Bottom 4

5 Stack Operations Push Value: A Top A Bottom 5

6 Stack Operations Push Value: B Top B A Bottom 6

7 Stack Operations Push Value: C Top C B A Bottom 7

8 Stack Operations Pop the Top of the Stack: Top C B A Bottom 8

9 Stack Operations Pop the Top of the Stack: Top B A Bottom 9

10 A Stack Interface in Java public interface Stack<AnyType> { public void push( AnyType x ); public AnyType pop( ); public AnyType peek( ); public boolean isempty( ); } public void makeempty( ); 10

11 Stack Implementations Stacks can be implemented in multiple ways Two popular methods for implementing stacks include - (1) Arrays - (2) Linked Lists Both of these implementation approaches allow for constant time operations - O(1) 11

12 Stack Implementation Using an Array Start with Empty Stack (i.e. an array) first column is array index top-of-stack pointer is initialized to top-of-stack 12

13 Stack Implementation Using an Array Insert Value: A top-of-stack 0 A 13

14 Stack Implementation Using an Array Insert Value: B top-of-stack 1 0 B A 14

15 Stack Implementation Using an Array Insert Value: C 4 3 top-of-stack C B A 15

16 Stack Implementation Using an Array Pop the Top of the Stack: 4 3 top-of-stack C B A 16

17 Stack Implementation Using an Array Pop the Top of the Stack: top-of-stack 1 B 0 A 17

18 Stack Implementation Using an Array Considerations when using an array implementation - push, pop, and peek operations all run in constant time... in most cases - What happens when your array is full and you want to push another element? Array must be increased in size which takes time an more memory Time to copy and create new array is O(N) Time to copy array is amortized over the lifetime of the array May not be suitable for all types of systems (e.g. RTOS) 18

19 Stack Implementation Using an Array (Java) /** * Stack constructor */ public ArrayStack( ) { thearray = (AnyType []) new Object[ DEFAULT_CAPACITY ]; topofstack = -1; } 19

20 Stack Implementation Using an Array (Java) /** * Test if the stack is logically empty. true if empty, false otherwise. */ public boolean isempty( ) { return topofstack == -1; } 20

21 Stack Implementation Using an Array (Java) /** * Make the stack logically empty. */ public void makeempty( ) { topofstack = -1; } 21

22 Stack Implementation Using an Array (Java) /** * Insert a new item into the stack. x the item to insert. */ public void push( AnyType x ) { if( topofstack + 1 == thearray.length ) doublearray( ); thearray[ ++topofstack ] = x; } 22

23 Stack Implementation Using an Array (Java) /** * Remove the most recently inserted item from the stack. UnderflowException if the stack is empty. */ public void pop( ) { if( isempty( ) ) throw new UnderflowException( "ArrayStack pop" ); topofstack--; } 23

24 Stack Implementation Using an Array (Java) /** * Get the most recently inserted item in the stack. * Does not alter the stack. the most recently inserted item in the stack. UnderflowException if the stack is empty. */ public AnyType peek( ) { if( isempty( ) ) throw new UnderflowException( "ArrayStack top" ); return thearray[ topofstack ]; } 24

25 Stack Implementation Using an Array (Java) /** * Internal method to extend thearray. */ private void doublearray( ) { AnyType [ ] newarray; } newarray = (AnyType []) new Object[ thearray.length * 2 ]; for( int i = 0; i < thearray.length; i++ ) newarray[ i ] = thearray[ i ]; thearray = newarray; 25

26 Stack Implementation Using a LinkedList Start with Empty Stack (i.e. a null LinkedList) top-of-stack points to the head of the top-of-stack NULL 26

27 Stack Implementation Using a LinkedList Push Value: A top-of-stack A NULL 27

28 Stack Implementation Using a LinkedList Push Value: B top-of-stack B A NULL 28

29 Stack Implementation Using a LinkedList Push Value: C top-of-stack C B A NULL 29

30 Stack Implementation Using a LinkedList Pop the Top of the Stack: top-of-stack C B A NULL 30

31 Stack Implementation Using a LinkedList Pop the Top of the Stack: top-of-stack B A NULL 31

32 Stack Implementation Using a LinkedList Considerations when using a LinkedList implementation - push, pop, and peek operations all run in constant time... still - Each element inserted into the stack requires a pointer to the data and a second pointer to the next node in the LinkedList 32

33 Stack Implementation Using a LinkedList (Java) /** * Stack constructor */ public ListStack( ) { topofstack = null; } private ListNode<AnyType> topofstack; 33

34 Stack Implementation Using a LinkedList (Java) /** * Test if the stack is logically empty. true if empty, false otherwise. */ public boolean isempty( ) { return topofstack == null; } 34

35 Stack Implementation Using a LinkedList (Java) /** * Make the stack logically empty. */ public void makeempty( ) { topofstack = null; } 35

36 Stack Implementation Using a LinkedList (Java) /** * Insert a new item into the stack. x the item to insert. */ public void push( AnyType x ) { topofstack = new ListNode<AnyType>( x, topofstack ); } 36

37 Stack Implementation Using a LinkedList (Java) /** * Remove the most recently inserted item from the stack. UnderflowException if the stack is empty. */ public void pop( ) { if( isempty( ) ) throw new UnderflowException( "ListStack pop" ); topofstack = topofstack.next; } 37

38 Stack Implementation Using a LinkedList (Java) /** * Get the most recently inserted item in the stack. * Does not alter the stack. the most recently inserted item in the stack. UnderflowException if the stack is empty. */ public AnyType peek( ) { if( isempty( ) ) throw new UnderflowException( "ListStack top" ); return topofstack.element; } 38

39 Example Applications for Stacks Postfix expression evaluation * 4 vs * + Checking for balanced delimiters - Balancing parenthesis/braces in a programming languages 39