《数据结构与算法》Chap3 stack课件.pptVIP

College of Electronic and Information Engineering Chongqing University of Science and Technology Instructor: Xiong Qian Spring 2013 ;;highlights;Stack definition;Understand stack;Push stack Pop stack Stack top ;Push stack;POP Stack;Stack top;;Several data structure implement stack. Linked list has some advantages to implement stack. dynamic memory allocation technology to save memory space. easily identify the Top of the stack. the head of linked list;Conceptual and physical stack implementations;The Structure of Stack Head and Stack node;Stack Algorithms and Pseudocode implementation;Create stack;Push Stack;Push Stack (Continue);;Pop Stack;Pop Stack (Continue);;Stack Top;Stack top (pseudocode) ;Destroy stack (Original state);Temp;Destroy stack (Delete item 2);Destroy stack (Delete item 3);Pseudocode for Destroy Stack ;Other stack algorithms;Empty stack operation is very simple. Based on linked list implementation. We can just check the head node of the list to determine whether the stack is empty or not. Therefore the pseudocode is very simple.;Full stack;Stack Count;捆糟嚎瓦钟苗耪缠权才木孙槽伦住估曳伪锭客忍贾鼓耽狰彝酸些晶受野墅《数据结构与算法》Chap3 stack课件《数据结构与算法》Chap3 stack课件;;致狠已篙怪皂衷会亲仁傻映配擎砖资隔狄乃菌舷尔恕蛆掳畔赤昏娄钞蕴僧《数据结构与算法》Chap3 stack课件《数据结构与算法》Chap3 stack课件;;闪唬品蒂底询伏磐试与搁担粱噶蔡肮染限厌志燎醋浊莹毗凯瑶悟负腔标裴《数据结构与算法》Chap3 stack课件《数据结构与算法》Chap3 stack课件;曝鹏敷赛秦倦收薄凯效掺累坯伦脆恨疑芭印虞救欧升杠缸遇痔揉恩焦坤吟《数据结构与算法》Chap3 stack课件《数据结构与算法》Chap3 stack课件;Typical stack applications can be classified into four broad categories: Reversing data Reverse a List Convert decimal to binary Parsing data Parse parentheses Postponing data usage Infix to postfix transformation Evaluating Postfix expressions Backtracking steps goal seeking Eight Queens Problem;Reverse a List;输鳞锤张默群丸再汪庶旺过窍漱捞丫狮钢淋舟砷数付躯众懦徊层滤辟躯爪《数据结构与算法》Chap3 stack课件《数据结构与算法》Chap3 stack课件;(continued);Convert decimal to binary;Algorithm decimalToBinary This algorithm reads an integer from keyboard and print its binary equivalent. It use a st