CSCE3110DataStructuresAlgorithmAnalysis课件.pptVIP

CSCE 3110Data Structures Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss Stacks Stack: what is it? ADT Applications Implementation(s) What is a stack? Stores a set of elements in a particular order Stack principle: LAST IN FIRST OUT = LIFO It means: the last element inserted is the first one to be removed Example Which is the first element to pick up? Last In First Out Stack Applications Real life Pile of books Plate trays More applications related to computer science Program execution stack (read more from your text) Evaluating expressions objects: a finite ordered list with zero or more elements. methods: for all stack ? Stack, item ? element, max_stack_size  ? positive integer Stack createS(max_stack_size) ::= create an empty stack whose maximum size is  max_stack_size Boolean isFull(stack, max_stack_size) ::= if (number of elements in stack == max_stack_size) return TRUE else return FALSE Stack push(stack, item) ::= if (IsFull(stack)) stack_full else insert item into top of stack and return Boolean isEmpty(stack) ::= if(stack == CreateS(max_stack_size)) return TRUE else return FALSEElement pop(stack) ::= if(IsEmpty(stack)) return else remove and return the item on the top  of the stack. Array-based Stack Implementation Allocate an array of some size (pre-defined) Maximum N elements in stack Bottom stack element stored at element 0 last index in the array is the top Increment top when one element is pushed, decrement after pop Stack createS(max_stack_size) ::= #define MAX_STACK_SIZE 100 /* maximum stack size */ typedef struct { int key; /* other fields */ } element; element