数据结构上机实验源代码.doc

数据结构上机实验源代码 栈的应用 十进制数转换为八进制数， 逆序输出所输入的数 实验代码： //stack.h，头文件 class stack{ public:stack(); bool empty()const; bool full()const; error_code gettop(elementtype x)const; error_code push(const elementtype x); error_code pop(); private: int count; elementtype data[maxlen]; }; stack::stack(){ count=0; } bool stack::empty()const { return count==0; } bool stack::full()const { return count==maxlen; } error_code stack::gettop(elementtype x)const { if(empty())return underflow; else{ x=data[count-1]; return success; } } error_code stack::push(const elementtype x) { if(full())return overflow; data[count]=x; count++; return success; } error_code stack::pop() { if(empty())return underflow; count--; return success; } //主程序 #includeiostream.h enum error_code{overflow,underflow,success}; typedef int elementtype; const int maxlen=20; #includestack.h void read_write() //逆序输出所输入的数 { stack s; int i; int n,x; coutplease input num int n:; cinn; for(i=1;i=n;i++) { coutplease input a num:; cinx; s.push(x); } while(!s.empty()) { s.gettop(x); coutx ; s.pop(); } coutendl; } void Dec_to_Ocx(int n) //十进制转换为八进制 { stack s1; int mod,x; while(n!=0) { mod=n%8; s1.push(mod); n=n/8; } coutthe ocx of the dec is:; while(!s1.empty()) { s1.gettop(x); coutx; s1.pop(); } coutendl; } void main() {int n; // read_write(); coutplease input a dec:; cinn; Dec_to_Ocx(n); } 队列的应用 打印n行杨辉三角 实验代码： //queue.h class queue{ public:queue(){ count=0; front=rear=0;} bool empty(){ return count==0; } bool full(){ return count==maxlen-1; } error_code get_front(elementtype x){ if(empty())return underflow; x=data[(front+1)%maxlen]; return success; } error_code append(const elementtype x) { if(full())return overflow; rear=(rear+1)%maxlen; data[rear]=x; count++; return success; } error_code serve(){ if(