C++中二叉树实现方法.docVIP

[cpp]?view plain?copy #ifndef?_BINARYTREE_H_?? #define?_BINARYTREE_H_?? ?? const?int?MaxSize?=?100;?? ?? templateclass?T?? struct?BTNode?? {?? ????T?data;?? ????BTNodeT?*lchild;?? ????BTNodeT?*rchild;?? };?? ?? templateclass?T?? class?BinaryTree?? {?? public:?? ????BinaryTree();???????????????????//构造函数?? ????~BinaryTree();??????????????????//析构函数?? ????void?PreOrder(){PreOrder(r);}???//递归前序遍历?? ????void?InOrder(){InOrder(r);}?????//递归中序遍历?? ????void?PostOrder(){PostOrder1(r);}?//递归后序遍历?? ????void?PreOrder1(){PreOrder1(r);}???//非递归前序遍历?? ????void?InOrder1(){InOrder1(r);}?????//非递归中序遍历?? ????void?PostOrder1(){PostOrder(r);}?//非递归后序遍历?? ????void?LevelOrder(){LevelOrder(r);}//层序遍历?? ????BTNodeT*?FindNode(T?x){FindNode(r,x);}//查找结点?? ????int?BTNodeHeigth(){BTNodeHeigth(r);}//树的高度?? ????int?NodeCount1(){NodeCount1(r);}????//基于前序遍历求结点个数?? ????int?NodeCount2(){NodeCount2(r);}????//基于中序遍历求结点个数?? ????int?NodeCount3(){NodeCount3(r);}????//基于后序遍历求结点个数?? ????int?NodeCount4(){NodeCount4(r);}????//递归求结点个数?? ????void?DispLeaf(){DispLeaf(r);}???????//输出树的叶子结点?? ????void?printRouteLength(){printLeavesDepth(r,?0);}//输出树的叶子结点到根结点的路径长度?? ????bool?printAncestor(T?x){printAncestor(r,x);}????//输出值为x的结点的祖先结点?? private:?? ????BTNodeT?*r;?? ????BTNodeT*?CreateTree(BTNodeT?*t);//构造函数调用?? ????void?DestroyTree(BTNodeT?*t);?????//析构函数调用?? ????void?PreOrder(BTNodeT?*t);????????//递归前序遍历调用?? ????void?InOrder(BTNodeT?*t);?????????//递归中序遍历调用?? ????void?PostOrder(BTNodeT?*t);???????//递归后序遍历调用?? ????void?PreOrder1(BTNodeT?*t);????????//非递归前序遍历调用?? ????void?InOrder1(BTNodeT?*t);?????????//非递归中序遍历调用?? ????void?PostOrder1(BTNodeT?*t);???????//非递归后序遍历调用?? ????void?LevelOrder(BTNodeT?*t);???????//层序遍历调用?? ????BTNodeT*?FindNode(BTNodeT?*t,?T?x);?? ????int?BTNodeHeigth(BTNodeT?*t);?? ????int?NodeCount1(BTNodeT?*t);???????//前序遍历求结点个数调用?? ????int?NodeCount2(BTNodeT?*t);???????//中序遍历求结点个数调用?? ????int?NodeCount3(BTNodeT?*t);???????//后序遍历求结点个数调用?? ????int?NodeCount4(BTNodeT?*t);???????//递归求结点个数调用?? ????void?DispLe