浅谈栈和队列.docVIP

浅谈栈和队列 摘要关键词Stack and Queue Abstract: Stack as a kind of data structure, it is a kind of can in the end of the insert and delete operation of the special linear list. Queue is a special kind of linear list, it is allowed only in the front of the table (front) to delete operation, but in the table after end (rear) insertion operation. For insertion operation of the end called rear, to delete operation of the end called team head. The queue no element, called empty queue. Key words: Stack and queue ;Data structure ; Linear list; Abstract data type 0 引言 栈（Stack）是限定只能在表的一端进行插入和删除操作的线性表。队列是一种特殊的线性表，它只允许在表的前端（front）进行删除操作，而在表的后端（rear）进行插入操作。在队列这种数据结构中，最先插入的元素将是最先被删除的元素；反之最后插入的元素将是最后被删除的元素，因此队列又称为“先进先出”（FIFO—first in first out）的线性表。 1.2栈的顺序存储结构及实现 由于栈也是线性表，因此线性表的存储结构对栈也适用，通常栈有顺序栈和链栈两种存储结构，这两种存储结构的不同，则使得实现栈的基本运算的算法也有所不同。 #includeiostream.hstruct node{int data;node *next;}; class LinkStack{public:LinkStack(){top=NULL;} //构造函数置空链栈~LinkStack(); //析构函数，释放链栈中个节点的存储空间void Push(int x); //将元素x进栈int Pop(); //将栈顶元素出栈int Gettop() //获取栈顶元素{if(top!=NULL)return top-data;} //取栈顶元素（并不删除）bool empty() //判断链栈是否为空栈{if(top==NULL)return 1;elsereturn 0;} private:node *top; //栈顶指针即链栈的头指针}; void LinkStack::Push(int x) //元素进栈{ node *s=new node; //申请一个数据域为x的节点ss-data=x;s-next=top; //将节点s插在栈顶top=s;} int LinkStack::Pop() //元素出栈{ int x;if(top==NULL) throw下溢;x=top-data; //暂存栈顶元素 node *p=top; //将栈顶节点摘链top=top-next;delete p;return x;}LinkStack::~LinkStack() //析构函数将链栈中所有节点的存储空间释放{while(top){node *p=top-next;delete top;top=p;}} void main(){LinkStack link;int data;cout请输入进栈的10个元素:;for(int i=0;i10;i++) //输入进栈的10个元素{cindata;link.Push(data);}link.Pop(); //栈顶元素出栈cout现在栈顶的元素为:link.Gettop()endl; //输出栈顶元素while(!link.empty()) cout现在出栈的是：link.Pop()endl; //所有元素一个一个出栈}Const int QueueSize=100; Templateclass DataType Class CirQueue { Public: cirQueue(){front=rear=QueueSize-1;} ~cirQueue(){} Void EnQueue(DataType x); DataType DeQueue(); DataType GetQueue(); Int E