二叉树及其上基本操作.doc

#includeiostream #includestdlib.h #define N 10; template class T struct BinTreeNode{ //二叉树结点类定义 T data; BinTreeNodeT *left,*right; BinTreeNode():leftChild(NULL),rightChild(NULL){} BinTreeNode(T x,BinTreeNodeT *l=NULL,BinTreeNodeT *r=NULL) :data(x),left(l),right(r){} }; template class T class BinTree{ public: BinTree():root(NULL){} BinTree(T value=0):RefValue(value),root(NULL){} BinTree(BinTreeT s); ~BinTree(){Destroy(root);} BinTreeNodeT Getroot()const{return root;} //取根 bool Isempty(){return (root==NULL)?true:false;} BinTreeNodeT * Parent(BinTreeNodeT *current); //寻找父结点 BinTreeNodeT *LeftChild(BinTreeNodeT *current) //寻找左右子结点 {return (current!=NULL)?current-left:NULL;} BinTreeNodeT *RightChild(BinTreeNodeT *current) {return (current!=NULL)?current-right:NULL;} BinTreeNodeT *Setleft(BinTreeNodeT *current){left=current;}//设置左右子结点 BinTreeNodeT *Setright(BinTreeNodeT *current){right=current;} BinTreeNodeT *Create(); //创建树 void Preorder(BinTreeNodeT *t); //先根遍历 void Inorder(BinTreeNodeT *t); //中根遍历 void Postorder(BinTreeNodeT *t); //后根遍历 bool Find(T x); //查找符合数据域条件的结点 void Destroy(BinTreeNodeT subtree); //删除子树 void Del(BinTreeNodeT *p); void out(BinTreeNodeT *t); //以表格形式输出二叉树 private: BinTreeNodeT *root; T RefValue; }; template class T BinTreeNodeT *BinTreeT::Parent(BinTreeNodeT *current) //父结点 { if(current==NULL||Isempty()) return NULL; if(root-left==current||root-right==current) return root; BinTreeNodeT *q; q=Parent(root-left); if(q!=NULL) return q; return q=Parent(root-right); } template class T bool BinTreeT::Find(BinTreeNodeT *t,T x) //符合数据域条件的结点 { if(Isempty()) return false; if(t-data==x) return true; BinTreeNodeT *q; q=Find(t-left,x); if(q!=NULL) return q; return q=Find(t-right,x); } tem