数据结果Chapter3StackandQueue.pptxVIP

Chap3 Stack and Queue 3.1 Stack 3.1.1 Stack Model 3.1.2 Implementation of Stacks Array implementation of stacks Linked list implementation of stacks 3.1.3 Applications 3.1.1 Stack Model A stack is a list with the restriction that insertions and deletions can be performed in only one position, namely, the end of the list, called the top, the other end is called bottom. We called the special stack without any element an empty stack. The fundamental operations on a stack are Push, which is equivalent to an insert, and Pop, which deletes the most recently inserted element; The most recently inserted element can be examined prior to performing a Pop by use of the Top routine. Example3.1 Bottom A1 A2 A3 …… Push Pop A Pop or Top on an empty stack is generally considered an error in the stack. On the other hand, running out of space when performing a Push is not an implementation error but an ADT error. Stacks are sometimes known as LIFO(last in, first out) lists. Pushes are input operations and Pops and Tops are output. The usual operations to make empty stacks and test for emptiness are parts of the repertoire, but essentially all that you can do to a stack is Push and Pop. 3.1.2 Implementation of Stacks Since a stack is a list, any list implementation will do. We will give two popular implementations. One uses arrays and the other uses pointers, but, as we saw in the previous section, if we use good programming principles, the calling routines do not need to know which method is being used. Array Implementation of Stacks The only potential hazard with this strategy is that we need to declare an array size ahead of time. Actually, it’s usually easy to declare the array to be large enough without wasting too much space. If this is not possible, then a safe course would be to use a linked list implementation. Associated with each stack is TopOfStack, which is -1 for an empty stack (this is how an empty stack is initialized). One problem