[工学]数据结构3章.ppt

Chapter 03 Stack Queue第三章 栈和队列 Prof. Qing Wang 本章学习的线索 主要线索 重点 栈和队列的顺序存储表示 栈和队列的应用 难点 栈和递归的关系 Content Stack and its ADT Representation Implementation of Stack Application of Stack Recursion and Stack Queue and its ADT Representation Implementation of Queue Application of Queue Conclusion Chapter 03 Stack Queue 3.1 Stack and its ADT Definition A stack is a kind of special linear list. A stack is a data structure in which all insertions and removals of entries are made at one end, called the top of the stack. LIFO structure: The last entry which was inserted is the first one that will be removed. (LIFO: Last In First Out) Top Bottom Top The specific end of linear list at which elements can inserted and removed. Bottom Another end of the stack. Examples of Push and Pop 3.1.2 Basic operations of Stack Stack ADT 3.2 Implementation of Stack Sequential Stack Question 1 Two stacks shared in the same array. Initialization. Push entry into stack 1 or stack 2. Pop entry from stacks. Critical conditions Empty Full Overflow Question 2 n stacks in the same array Example Linked stack 3.3 Applications of Stack Bracket matching Reverse Poland calculator Transform of the arithmetic expression Bracket Matching Program int main() { LinkStack openings; char symbol; bool is_matched = true; ? while (is_matched (symbol = cin.get()) != \n) { if (symbol == { || symbol == ( || symbol == [) openings.push(symbol); if (symbol == } || symbol == ) || symbol == ]) { if (openings.empty()) { cout Unmatched closing bracket symbol detected. endl; is_matched = false; } else { char match; match=openings.top(); openings.pop(); is_matched = (symbol == } match == {) || (symbol == ) match == () || (symbol == ] match == [); if (!is_matched) cout Bad match match