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

《合肥工业大学数据结构二叉树实验报告.docx》由会员上传分享，免费在线阅读，更多相关内容在应用文档-天天文库。

1、合肥工业大学数据结构二叉树实验代码李亚鸣#include#include#include#include#include#include#includeusingnamespacestd;enumerrorcode{success,underflow,overflow};constintmaxlen=100;//栈类---------------------templateclassstack{public:sta

2、ck();boolempty();boolfull();errorcodeget_top(T&x);errorcodepush(Tx);errorcodepop(){if(empty())returnunderflow;elsecount--;returnsuccess;}private:Tdata[maxlen];intcount;};//-------------------------templateerrorcodestack::get_top(T&x){if(empty())returnunderflow;elsex=dat

3、a[count-1];returnsuccess;}templateerrorcodestack::push(Tx){if(full())returnoverflow;elsedata[count++]=x;returnsuccess;}templatestack::stack(){count=0;}templateboolstack::empty(){returncount==0;}templateboolstack::full(){returncount==maxl

4、en;}//队列类-------------------templateclassqueue{public:queue();boolempty()const;boolfull()const;errorcodeget_front(T&x);errorcodeappend(Tx);errorcodeserve();private:intflag;intfront,count,rear;Tdata[maxlen];};//-------------------------templatequeue::queue(){flag

5、=0;front=rear=0;}templateboolqueue::empty()const{if(front==rear&&flag==0)returntrue;elsereturnfalse;}templateboolqueue::full()const{if(front==rear&&flag==1)returntrue;elsereturnfalse;}templateerrorcodequeue::get_front(T&x){if(empty())returnunderflo

6、w;x=data[front%maxlen];returnsuccess;}templateerrorcodequeue::append(Tx){if(full())returnoverflow;data[rear%maxlen]=x;rear++;flag=1;returnsuccess;}templateerrorcodequeue::serve(){if(empty())returnunderflow;front++;flag=0;returnsuccess;}//类节点template//

7、------------------------classbnode{public:Tdata;bnode*rchild,*lchild;intltag,rtag;};intmax_x(intx,inty){returnx>=y?x:y;}//二叉树类---------------------------------templateclassbtree{bnode*root;intcount_bnode,count_leaf;intpre_k;//先序输出前k个计数charx;//临时输入intin_count;//中序遍历序号int

8、count;//计数bnode*in_thread_pre;