数据结构精品课程PPT5.ppt

Stacks A stack is a sequence of items that are accessible at only one end of the sequence. Further Stack Examples Pushing/Popping a Stack Stack Implementation Stack Implementation Stack Implementation (vector) Using a Stack to Create a Hex Number Using a Stack to Create a Hex Number Uncoupling Stack Elements Uncoupling Stack Elements Uncoupling Stack Elements Uncoupling Stack Elements Uncoupling Stack Elements Uncoupling Stack Elements Uncouple Algorithm Stack Implementation (array) Stack Implementation (array) Stack Implementation (array) Stack Implementation (array) Stack Implementation (LinkedList) Stack Implementation (LinkedList) Stack Implementation (LinkedList) Stack Implementation (LinkedList) Recursive Code and the Running Stack Recursive Code and the Running Stack Postfix expressions：逆波兰表达式，后缀表达式 PostfixEval Class PostfixEval Class PostfixEval Class PostfixEval Class PostfixEval Class 中缀表达式转后缀表达式 InfixEval Expression Evaluation Infix-to-postfix Conversion Rules for Infix Expression Evaluation Infix-to-Postfix Evaluation: Object Design Infix-to-Postfix Evaluation: Object Design Infix-to-Postfix Evaluation: Object Design Infix-to-Postfix Evaluation: Object Design Infix-to-Postfix Evaluation: Object Design Infix-to-Postfix Evaluation: Object Design Infix-to-Postfix Evaluation: Object Design Infix-to-Postfix Evaluation: Object Design Infix-to-Postfix Evaluation: Object Design Infix-to-Postfix Evaluation: Object Design Infix: a+b*c postfix: abc*+ Infix: (a+b)*c postfix: ab+c* Infix: (a*b+c)/d+e postfix: ab*c+d/e+ Rule 1: Scan the infix expression from left to right. Immediately record an operand as soon as you identify it in the express. Rule 2: Record an operator as soon as you identify its operands. 注：波兰逻辑学家 J.Lukasiewicz于1929年提出的一种表示表达式的方法。 * Main Index Contents class postfixEval { public: postfixEval(); string getPostfixExp() const; void setPostfixExp(const string postfixExp); int evaluate(); private: string postfix