二叉树的递归遍历.doc

文档介绍：#include<>
#include<>
#define OVERFLOW -1
typedef struct BiTNode
{
int data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
void visit(char ch)
{
printf("%5c",ch);
}
void CreateBiTree(BiTree &T)
{
char ch ;
scanf("%c",&ch);
if(ch==' ') T=NULL;
else
{
T=(BiTree)malloc(sizeof(BiTNode));
if(!T) exit(OVERFLOW);
T->data=ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
}
void PreOrderTraverse(BiTree T,void(*Visit)(char))
{
if(T)
{
Visit(T->data);
PreOrderTraverse(T->lchild,Visit);
PreOrderTraverse(T->rchild,Visit);
}
}
void InOrderTraverse(BiTree T,void(*Visit)(char))
{
if(T)
{
InOrderTraverse(T->lchild,Visit);
Visit(T->data);
InOrderTraverse(T->rchild,Visit);
}
}
void PostOrderTraverse(BiTree T,void(*Visit)(char))
{
if(T)
{ PostOrderTraverse(T->lchild,Visit);
PostOrderTraverse(T->rchild,Visit);
Visit(T->data);
}
}
int sum(BiTree T)
{
int m,n;
if(!T) return 0;
else
/*{
m=sum(T->lchild);
n=sum(T->rchild);
return m+n+1;
}*/

return sum(T->lchild)+sum(T->rchild)+1;
}
int Depth(BiTree T)
{
int m,n;
if(!T) return 0;
else
{
m=Depth(T->lch