二叉树的先序、中序、后序、层次遍历，叶子节点个数，二叉树的高度（c语言）

#include <stdio.h>
#include <stdlib.h>
#include <queue>
using namespace std;
typedef struct Tree
{
    int data;
    struct Tree *lchild;
    struct Tree *rchild;
} Tree, *BitTree;
BitTree CreateLink()
{
    int data;
    BitTree T;
    scanf("%d", &data);
    if (data == -1){            //输入-1中止输入 
        return NULL;
    }
    else{
        T = (BitTree)malloc(sizeof(Tree));
        T->data = data;
        printf("请输入%d的左子树: ", data);
        T->lchild = CreateLink();
        printf("请输入%d的右子树: ", data);
        T->rchild = CreateLink();
        return T;
    }
}
void XianXu(BitTree T)
{
    if (T == NULL){
        return;
    }
    printf("%d ", T->data);
    XianXu(T->lchild);
    XianXu(T->rchild);
}
void ZhongXu(BitTree T)
{
    if (T == NULL){
        return;
    }
    ZhongXu(T->lchild);
    printf("%d ", T->data);
    ZhongXu(T->rchild);
}
void HouXu(BitTree T)
{
    if (T == NULL){
        return;
    }
    HouXu(T->lchild);
    HouXu(T->rchild);
    printf("%d ", T->data);
}
void CengCi(BitTree T)
{
    	if (T == NULL){
        return;
   	 	}
    queue<BitTree> q;
    int count = 1;
    int current = 1;
    q.push(T);
    while (!q.empty()){
        count = current;
        while (count > 0)
        {
            BitTree t = q.front();
            q.pop();
            printf("%d ", t->data);
            if (t->lchild != NULL){
                q.push(t->lchild);
                current++;
            }
            if (t->rchild != NULL){
                q.push(t->rchild);
                current++;
            }
            current--;
            count--;
        }
    }
}
int countleaf(BitTree T){
	int n1,n2;
	if(T == NULL)
	return 0;
	else if(T->lchild == NULL && T->rchild == NULL)
	return 1;
	else{
		n1 = countleaf(T->lchild);
		n2 = countleaf(T->rchild);
		return(n1+n2);
	}
}
int max(int x,int y){
	return x>y?x:y;
}
int high(BitTree T){
	if(T == NULL)
	return 0;
	else return(max(high(T->lchild),(high(T->rchild)))+1);
}
int main()
{
    BitTree S;
    printf("请输入第一个节点的数据:\n");
    S = CreateLink();
    printf("先序遍历结果: \n");
    XianXu(S);
    printf("\n中序遍历结果: \n");
    ZhongXu(S);
    printf("\n后序遍历结果: \n");
    HouXu(S);
    printf("\n层次遍历结果：\n");
    CengCi(S);
	printf("\n二叉树叶子节点个数为：\n");
    printf("%d",countleaf(S));
    printf("\n二叉树高度为：\n");
    printf("%d",high(S));
    return 0;
}