数据结构树的学习

数据结构树的学习，编写代码，并测试，学习一下递归的思想

#include <stdio.h>
#include <stdlib.h>

typedef int ElemType;//数据类型
typedef int Status;
 
typedef struct BiTNode{
	ElemType data;
	struct BiTNode *lChild,*rChild;
}BiTNode, *BiTree;

//先序
Status CreateBiTree(BiTree *T)
{
	ElemType ch;
	ElemType temp;
	
	scanf("%d",&ch);
	temp = getchar();
	
	if(ch == -1)
	{
	   *T = NULL; 
	} 
    else
	{
		*T = (BiTree)malloc(sizeof(BiTNode));
		if(!(*T))
		  exit(-1);
		(*T)->data = ch;
		printf("输入%d的左子节点：",ch); 
		CreateBiTree(&(*T)->lChild);
		printf("输入%d的右子节点：",ch);
		CreateBiTree(&(*T)->rChild);	
	} 
	return 1;
}    
void TraverseBiTree(BiTree T)
{
	if(T == NULL)
	  return ;
	printf("%d",T->data);
	TraverseBiTree(T->lChild);
	TraverseBiTree(T->rChild);
}

void InOrderBiTree(BiTree T)
{
	
	if(T == NULL)
	  return ;
	InOrderBiTree(T->lChild);
    printf("%d",T->data);
	InOrderBiTree(T->rChild);
}

void PostOrderBiTree(BiTree T)
{
	
	if(T == NULL)
	  return ;
	PostOrderBiTree(T->lChild);
	PostOrderBiTree(T->rChild);
	printf("%d",T->data);
}

int TreeDeep(BiTree T)
{
	int deep = 0;
	if(T)
	{
		int leftdeep = TreeDeep(T->lChild);
		int rightdeep = TreeDeep(T->rChild);
		deep = leftdeep>=rightdeep? leftdeep + 1:rightdeep + 1;
	}
	return deep;
}

int Leafcount(BiTree T, int &num)
{
	if(T)
	{
		if(T->lChild == NULL && T->rChild == NULL)
	    num++;
	    Leafcount(T->lChild,num);
        Leafcount(T->rChild,num);
	}
	return num;
}
int main(void)
{
//  BiTree T;
  BiTree *T = (BiTree*)malloc(sizeof(BiTree));
  int deepth,num=0 ;
  printf("请输入第一个结点的值,-1表示没有叶结点:\n");
  CreateBiTree(T);
  printf("先序遍历二叉树:\n");
  TraverseBiTree(*T);
  printf("\n");
  printf("中序遍历二叉树:\n");
  InOrderBiTree(*T);
  printf("\n");
  printf("后序遍历二叉树:\n");
  PostOrderBiTree(*T);
  printf("\n");
  deepth=TreeDeep(*T);
  printf("树的深度为:%d",deepth);
  printf("\n");
  Leafcount(*T,num);
  printf("树的叶子结点个数为:%d",num);
  printf("\n");
  return 0;
}