数据结构与算法Ch01.pptVIP

Sample class for node class node {private: node *next; student data;public: node():next(NULL){}; node(student d,node *n):data(d),next(n){}; ~node(){};void setnext(node *n){ next=n;}node* getnext(){return next;} }  Operations Insertion- beginning, end Deletion- beginning, end Search Merge …… Linked List better? Arrays allow random access of memory Traverse time is more- sequential scanning to locate the elements Space for pointer information, single pointer or double pointer Stack ? An opaque pipe closed at one end. ? Only one element at a time is available, no other information is accessible. ? Addition and deletion of elements only at the open end. ? Last in first out (LIFO) behaviour. Stack Operations ? clear() – clear/empty the stack ? isEmpty() – check if it is empty ? isFull() – check if it is full? ? push(el) – Put the element el on the top of the stack. ? pop() - remove the topmost element from the stack. ? topEl() - Return the topmost element without removing it. Stack Operations push(item) - item becomes the new top element push (3) (3) push (10) (10, 3) pop() - top element removed. An error if stack is empty. i = pop () Value of i becomes 10 Stack Application Many cases of LIFO(last-in first-out) applications in computer science, particularly programming language implementation, algorithms and operating systems. We will discuss the bracket matching problem as a case study., Delimiter matching., Addition of numbers Bracket Matching Problem ? [ ( [ ) ) ] - ? invalid ? [ ] ( ) ( [ ] ) - ? valid ? [ { } ( [ ] ) ] - ? Valid Conditions: ? Every open bracket should be closed by the appropriate close bracket. ? No extra close brackets. ? The last bracket opened should be closed first. ? Stack should be empty at the end Pseudo Code valid = true // assume string is valid so far Stack s = new Stack(); s.clear(); while (valid (input not over )){ read next symbol (symb) ; if (symb is ‘(‘ or ‘[‘ or ‘{