合肥工业大学数据结构二叉树实验报告书.docxVIP

合肥工业大学数据结构二叉树实验代码2014211590 李亚鸣#includeiostream#includefstream#includestring#includestdio.h#includestdlib.h#includeWindows.h#includecmathusing namespace std;enum errorcode{ success, underflow, overflow };const int maxlen = 100;//栈类---------------------templateclass Tclass stack{public:stack();bool empty();bool full();errorcode get_top(T x);errorcode push(T x);errorcode pop(){if (empty()) return underflow;else count--;return success;}private:T data[maxlen];int count;};//-------------------------templateclass Terrorcode stackT::get_top(T x){if (empty()) return underflow;else x = data[count - 1];return success;}templateclass Terrorcode stackT::push(T x){if (full()) return overflow;else data[count++] = x;return success;}templateclass TstackT::stack(){count = 0;}templateclass Tbool stackT::empty(){return count == 0;}templateclass Tbool stackT::full(){return count == maxlen;}//队列类-------------------templateclass Tclass queue{public:queue();bool empty()const;bool full()const;errorcode get_front(T x);errorcode append(T x);errorcode serve();private:int flag;int front, count, rear;T data[maxlen];};//-------------------------templateclass TqueueT::queue(){flag = 0;front = rear = 0;}templateclass Tbool queueT::empty()const{if (front == rearflag == 0) return true;else return false;}templateclass Tbool queueT::full()const{if (front == rearflag == 1) return true;else return false;}templateclass Terrorcode queueT::get_front(T x){if (empty()) return underflow;x = data[front%maxlen];return success;}templateclass Terrorcode queueT::append(T x){if (full()) return overflow;data[rear % maxlen] = x;rear++;flag = 1;return success;}templateclass Terrorcode queueT::serve(){if (empty()) return underflow;front++;flag = 0;return success;}//类节点templateclass T//------------------------class bnode{public:T data;bnode *rchild, *lchild;int ltag, rtag;};int max_x(int x, int y){return x = y ? x : y;}//二叉树类---------------------------------templateclass Tclass btree{bnodeT *root;int count_bnode, count