实验1数据结构栈与队列的实现和应用.docVIP

实验1 栈和队列的实现和应用 实验目的 1.熟练掌握栈、队列的建立方法； 2.熟练掌握栈和队列基本操作； 3.栈和队列的实例应用 。 实验内容 1.选用一种存储结构建立栈、队列 2.栈的应用：A desk calculation（教科书P66） 3.队列验证：Menu-driven demonstration（教科书上P93） 实验结果 总结算法应用和结构优缺点 栈： #include iostream using namespace std; const int maxstack = 100; enum Error_code {success = 1, overflow = -1, underflow = -1}; typedef int Stack_entry; class Stack { public: Stack() { count = 0; } bool empty(); Error_code pop(); Error_code top(Stack_entryitem); Error_code push(const Stack_entry item); int size(); private: int count; Stack_entry entry[maxstack]; }; Error_code Stack::push(const Stack_entry item) { Error_code outcome = success; if(count = maxstack) { outcome = overflow; } else { entry[count++] =item; } return outcome; } Error_code Stack::pop() { Error_code outcome = success; if(count == maxstack) { outcome = underflow; } else { count--; } return outcome; } Error_code Stack::top(Stack_entry item) { Error_code outcome = success; if(count == 0) { outcome = underflow; } else { item = entry[count-1]; } return outcome; } bool Stack::empty() { bool outcome = true; if(count 0) { outcome = false; } return outcome; } int Stack::size() { return count; } int main() { Stack numbers; for(int i = 0; i 10; i++) { numbers.push(i); } int v; while(!numbers.empty()) { numbers.top(v); coutvendl; numbers.pop(); } return 0; } 队列: #include iostream using namespace std; const int maxqueue = 100; enum Error_code {success = 1, overflow = -1, underflow = -1}; typedef int Queue_entry; class Queue { public: Queue() { count = 0; rear = maxqueue-1; front = 0; } bool empty(); Error_code serve(); Error_code retrieve(Queue_entry item); Error_code append(const