第4 章 链式存储的表、栈和队列.ppt

void LinStackT::push(const Titem) { StackNodeT *newNode=new StackNodeT(item,top); top=newNode; size++; } template class T T LinStackT::pop(void) { if(size==0) { cerr堆栈空！endl; exit(1); } StackNodeT *p=top-next; T data=top-data; delete top; size--; top=p; return data; } 表达式计算 输入后缀表达式，计算表达式的值。 #include ctype.h #include LinStack.h template class T class Post { private: LinStackT s; //定义一个栈 void Enter(T num); //将数据元素T入栈 int Getdata(T op1,T op2); //出栈顶元素分 别到op1和op2中 void computer(char op); //做相应的运算，将结果入栈 public: Post(void){}; void run(void); void Clear(void); }; templateclass T void PostT::Enter(T num) { s.Push(num); } template class T int Getdata(T op1,T op2) { if(s.StackEmpty()) { cerr栈空!endl; return 0; } op1=s.Pop(); if(s.StackEmpty()) { cerr缺少操作数!endl; return 0; } op2=s.Pop(); return 1; } template class T void PostT::computer(char op) { int result; T operand1,operand2; result=Getdata(operand1,operand2); if(result==1) switch(op) { case +:s.Push(operand2+operand1);break; case -:s.Push(operand2-operand1);break; case *:s.Push(operand2*operand1);break; case /:s.Push(operand2/operand1);break; } else s.ClearStack(); } template class T void PostT::run(void) { char c; T newoperand; cout输入后缀表达式，以＃结束！endl; while(cinc,c!=#) { switch(c) { case +: case -: case *: case/: Compute(c); break; default:cin.putback(c); //是操作数，入栈 cinnewoperand; Enter(newoperand); break; } } if(!s.StackEmpty()) cout计算结果为：s.Peek()endl; } template class T void PostT::Clear(void) { s.ClearStack(); } #include Post.h void main(void) { Postfloat exp; exp.run(); } int linqueue::del(void) { if(size==0) { cerr“队列为空endl; exit(1); } node *p=front-next; int x=front-data; delete front; front=p; if(front==NULL) rear=NULL; size--; return x; } void radixsort(int a[],int n,int m,int d) { int i,j,k,power=1; linqueue *tub=new linqueue[d]; for(i=0;im;i++)//进行m次排