数据结构二叉树.doc

一、二叉树这是本人曾经做过的，希望能帮到大家#include#include#define OVERFLOW 0typedef char Status;typedef char TElemType; using namespace std;typedef struct BiTNodeTElemType data;struct BiTNode *lchild,*rchild;BiTNode,*BiTree;Status Visit(TElemType e)coutdata=c;CreateBiTree(T-lchild);CreateBiTree(T-rchild);return 1;Status xianOrderTraverse(BiTree T,Status(*Visit)(TElemType e)if(T)if(Visit(T-data )if (xianOrderTraverse(T-lchild ,Visit)if (xianOrderTraverse(T-rchild ,Visit)return 1;return 0;else return 1;Status ZhongOrderTraverse(BiTree T,Status(*Visit)(TElemType e)if(T)if (xianOrderTraverse(T-lchild ,Visit)if(Visit(T-data )if (xianOrderTraverse(T-rchild ,Visit)return 1; return 0;else return 1;Status HouOrderTraverse(BiTree T,Status(*Visit)(TElemType e)if(T)if (xianOrderTraverse(T-lchild ,Visit)if (xianOrderTraverse(T-rchild ,Visit) if(Visit(T-data )return 1; return 0;else return 1;int Depth(BiTree T)int depth, left,right;if(!T)depth=0;elseleft=Depth(T-lchild );right=Depth(T-rchild );depth=1+(leftright?left:right);return depth;int countleaf(BiTree T)if(!T) return 0;if(!T-lchild)&(!T-rchild) return 1;return (countleaf(T-lchild)+countleaf(T-rchild);int main()TElemType e;BiTree T;cout请输入树的元素endl;CreateBiTree(T);cout先序遍历为endl;xianOrderTraverse(T, Visit);coutendl;cout中序遍历为endl;ZhongOrderTraverse(T,Visit);coutendl; cout后序遍历为endl;HouOrderTraverse(T,Visit);coutendl;cout深度为endl; coutD