模板的练习二叉树.docx

1、模板的练习二叉树模板的练习-二叉树分类： C/C+ 2004-11-24 01:011165人阅读评论(0)收藏举报以下是对二叉树的基本操作的实现，如创建无序二叉树，二叉排序树，三种递归遍历和非递归遍历，查找，插入，删除,以及树叶的计算和树的深度的计算等。#include iostream.h#include stdlib.h#include stack.h#pragma oncetemplateclass CBiTreepublic: CBiTree(void) CBiTree(void) static struct _tagBiTNode T data; struct _tagBiTNod

2、e* lchild; struct _tagBiTNode* rchild; ;private: typedef _tagBiTNode BiTNode,*BiTree;public: bool CreateBiTree(BiTree& t); bool PreOrderTraverse(BiTree t,void (*visit)(T data); bool PreOrderTraverseEx(BiTree t,void (*visit)(T data); bool InOrderTraverse(BiTree t,void (*visit)(T data); bool InOrderTr

3、averseEx(BiTree t,void (*visit)(T data); bool PostOrderTraverse(BiTree t,void (*visit)(T data); bool PostOrderTraverseEx(BiTree t,void (*visit)(T data); void CountLeaf(BiTree t,int& count); int BiTreeDepth(BiTree t); /二叉排序树的操作 void CreateSortBiTree(BiTree &root,T* a,int n); void InsertNode(BiTree &r

4、oot,T e); bool DeleteNode(BiTree &t,T& e); bool SearchNode(BiTree t,T key,BiTree f,BiTree& p);private: void deleteNode(BiTree& p);/创建一个无序二叉树templatebool CBiTree:CreateBiTree(BiTree& t) int n; cinn; if(n=0) t=NULL; else if(!(t = new BiTNode) return false; t-data = n; CreateBiTree(t-lchild); CreateBiT

5、ree(t-rchild); return true;/先根遍历 递归表示templatebool CBiTree:PreOrderTraverse(BiTree t,void (*visit)(T data) if(t!=NULL) visit(t-data); PreOrderTraverse(t-lchild,visit); PreOrderTraverse(t-rchild,visit); return false;/先根遍历,栈表示templatebool CBiTree:PreOrderTraverseEx(BiTree t,void (*visit)(T data) try CS

6、tack:_tagStack s; /栈 CStack stack ; /if(stack = NULL) / return false; BiTree p = new BiTNode; if(p = NULL) return false; stack.InitStack(s); p = t; while(p|!stack.StackEmpty(s) if(p) visit(p-data); stack.Push(s,p); p = p-lchild; else stack.Pop(s,p); p = p-rchild; stack.DestroyStack(s); return true;

7、catch(.) visit(-1); return false; /中序遍历,递归算法templatebool CBiTree:InOrderTraverse(BiTree t,void (*visit)(T data) if(t != NULL) InOrderTraverse(t-lchild,visit); visit(t-data); InOrderTraverse(t-rchild,visit); return true;/中序遍历,栈表示templatebool CBiTree:InOrderTraverseEx(BiTree t,void (*visit)(T data) tr

8、y CStack:_tagStack s; CStack stack; BiTree p = new BiTNode; p = t; stack.InitStack(s); while(p|!stack.StackEmpty(s) if(p) stack.Push(s,p); p = p-lchild; else stack.Pop(s,p); visit(p-data); p = p-rchild; stack.DestroyStack(s); return true; catch(.) visit(-1); return false; /后序遍历,递归算法templatebool CBiT

9、ree:PostOrderTraverse(BiTree t,void (*visit)(T data) if(t != NULL) PreOrderTraverse(t-lchild,visit); PreOrderTraverse(t-rchild,visit); visit(t-data); return true;/后序遍历,栈表示templatebool CBiTree:PostOrderTraverseEx(BiTree t,void (*visit)(T data) try CStack:_tagStack s; CStack stack; BiTree p = new BiTN

10、ode; p = t; stack.InitStack(s); while(p|!stack.StackEmpty(s) if(p) stack.Push(s,p-lchild); p = p -lchild; else visit(p-data); stack.Pop(s,p); p = p-rchild; visit(p-data); return true; catch(.) visit(-1); return false; /计数树叶的个数templatevoid CBiTree:CountLeaf(BiTree t,int& count) if(t != NULL) CountLea

11、f(t-lchild,count); CountLeaf(t-rchild,count); /检查结点t是否为叶子结点,若是,则定量count+ if(t-lchild = NULL &t-rchild =NULL) count+; /树的深度templateint CBiTree:BiTreeDepth(BiTree t) int dep; int depleft; int deprigth ; if( t=NULL) dep = -1; if( t != NULL ) depleft = BiTreeDepth(t-lchild); deprigth = BiTreeDepth(t-rch

12、ild); dep = 1 + ( depleftdeprigth? depleft:deprigth); return dep;/templatebool CBiTree:SearchNode(BiTree t,T key,BiTree f,BiTree& p) if(t = NULL) p = f; return false; else if(key = t-data) p = t; return true; else if(key data) SearchNode(t-lchild,key,t,p); else SearchNode(t-rchild,key,t,p);templatev

13、oid CBiTree:InsertNode(BiTree &root,T e) BiTree t = root; BiTree p = NULL; BiTree newNode = new BiTNode; while(t) p = t; if(e data) t = t-lchild; else t = t-rchild; newNode-data = e; newNode-lchild = newNode-rchild =NULL; if(p=NULL) root = newNode; else if(e data) p-lchild = newNode; else p-rchild =

14、 newNode; /找到要删除的结点,删除结点templatevoid CBiTree:deleteNode(BiTree& p) BiTree q; BiTree s; if(!p-lchild) q = p; p = p-rchild; free(q); else if(!p-rchild) q = p; p = p-lchild; free(q); else q = p; s = p-lchild; while(s-rchild) q = s; s = s-rchild; p-data = s-data; if(q!=p) q-rchild = s-lchild; else q-lch

15、ild = s-lchild; /查找要删除的结点,并删除templatebool CBiTree:DeleteNode(BiTree &t,T& e) if(!t) return false; else if(e = t-data) deleteNode(t); else if(e data) DeleteNode(t-lchild,e); else DeleteNode(t-rchild,e); return true; / n 为数据的总长度 用n = sizeof(a) / sizeof(a0);templatevoid CBiTree:CreateSortBiTree(BiTree

16、&root,T* a,int n) for(int i=0;in;i+) InsertNode(root,ai); /*test*/void print(int data) if(data = -1) cout/nErrorendl; coutdata/t; int _tmain(int argc, _TCHAR* argv) cout/nBiTree:-/n; CBiTree:_tagBiTNode *p1= NULL; CBiTree* tree = new CBiTree; cout/n树的深度为:BiTreeDepth(t)CreateSortBiTree(p1,a,sizeof(a)

17、/sizeof(a0); coutPreOrderTraverse(p1,&print); coutPreOrderTraverseEx(p1,&print); cout/n中序遍历/nInOrderTraverse(p1,&print); coutInOrderTraverseEx(p1,&print); tree-CountLeaf(p1,n); cout/n树的深度为:BiTreeDepth(p1)endl; cout叶子:nendl; cout查找SearchNode(p1,3,NULL,t) cout找到了DeleteNode(p1,k0); tree-InOrderTraverse(p1,&print); else cout没找到endl;