根据二叉树的抽象数据类型的定义,使用二叉链表实现一个二叉树.docx

#includeusing namespace std;template struct BinodeT data;Binode *lch;Binode *rch;templateclass Bitreeprivate:void create(Binode*&R,T data,int i);void Destroy(Binode *R);public:Binode*root;Bitree(T data);Bitree();void preorder(Binode*R);void Inorder(Binode*R);void Postorder(Binode*R);void Levelorder(Binode*R);/*void find(T data);*/int Depth(Binode *R,int d);void path(Binode* root,char);Bitree();templatevoid Bitree:create(Binode*&R,T data,int i)if(datai-1!=0)R=new Binode;R-data=datai-1;R-lch=R-rch=NULL;create(R-lch,data,2*i);create(R-rch,data,2*i+1);/*templatevoid Bitree:find(T data)*/template Bitree:Bitree(T data)create(root,data,1);template void Bitree:preorder(Binode*R)if(R!=NULL)coutdata;preorder(R-lch);preorder(R-rch);template void Bitree:Inorder(Binode*R)if(R!=NULL)Inorder(R-lch);coutdata;Inorder(R-rch);template void Bitree:Postorder(Binode*R)if(R!=NULL)Postorder(R-lch);Postorder(R-rch);coutdata;templatevoid Bitree:Levelorder(Binode*R)Binode* queue10000;int f=0,r=0;if(R!=NULL)queue+r=R;while(f!=r)Binode*p=queue+f;coutdata;if(p-lch!=NULL)queue+r=p-lch;if(p-rch!=NULL)queue+r=p-rch;/销毁二叉树template void Bitree:Destroy(Binode *R)if (R!=NULL) Destroy(R-lch); Destroy(R-rch); delete R; template Bitree:Bitree()Destroy(root);template int Bitree:Depth(Binode *R,int d) if (R=NULL) return d; if (R-lch=NULL) & (R-rch=NULL)return d+1; elseint m = Depth(R-lch,d+1);int n = Depth(R-rch,d+1);return nm? n:m;templatevoid Bitree:path(Binode* root,char m)/求路径 Binode* stack10000; Binode*s; int tag10000; int top=0; s=root; do while(s!=NULL) top+; stacktop=s; tagtop=0; s=s-lch; if(top 0) if(tagtop=1) if(stacktop-data=m) cout 路径: ; for(int i=1;i =top;i+) coutdata; break; top-; else s=stacktop; if(top 0) s=s-rch; tagtop=1; while(s!=NULL|top!=0); void main() char buf400=0;for(int i = 0;i5;i+)bufi = i+65; Bitree ChBiTree(buf);cout前序遍历是endl;ChBiTree.preorder(ChBiTree.root);coutendl;cout中序遍历是endl;ChBiTree.Inorder(ChBiTree.root);coutendl;cout后序遍历是endl;ChBiTree.Postorder(ChBiTree.root);coutendl;cout层序遍历是endl;ChBiTree.Levelorder(