文本数据结构_stackqueue.pptx

Stack & Queue Yin Liang Institute of Geophysics and Geomatics Basic Concept of Stack A stack is still a list A special list The restriction is that insertion and deletion can be performed in only one position, the end of the list. The other end of stack is fixed. Basic Concept of Stack Two fundamental operations on a stack: Push and Pop Basic Concept of Stack Push: insert a new element at the top of the list Pop: delete the most recently inserted element Basic Concept of Stack A Pop operation on an empty stack is generally considered an error Running out of space when performing a Push operation is an implementation error Basic Concept of Stack Stacks are usually called as LIFO (Last in, First out) lists. Majority of the applications on stacks are based on their features of LIFO. Applications on stacks Numerical Conversion Balancing Symbols Infix Expression Path Finding Recursion Numerical Conversion How to convert a decimal number into a binary system? Fundamental principles: N=(N div d)×d + N mod d The order of outputs is reverse to that of inputs Numerical Conversion Algorithm: (decimal to Octal) (1)Initialize an empty stack and input a decimal number N (2)Is N 0? Yes, goto (3); or push(S, N%8)，N=N/8 (3)Is the stack empty? No, pop(S, e), output e; or, termination Applications on stacks Numerical conversion is directly based on the reverse relationship between the inputs and outputs of stacks Some advanced applications of stacks make use of the recovery of previous status