二叉树的一些操作

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

typedef struct BiNode{
    char data;
    struct BiNode* LChild;
    struct BiNode* RChild;
}BiNode,*BiTree;

void CreateBiTree(BiTree &T);//创建二叉树
int GetTreeHeight(BiTree T);//返回二叉树高度
int GetAllNode(BiTree T);//返回二叉树结点数
int GetZeroNode(BiTree T);//返回出度为0的结点数
int GetOneNode(BiTree T);//返回出度为1的结点数
int GetTwoNode(BiTree T);//返回出度为2的结点数
BiTree CopyBiTree(BiTree T);//复制二叉树并将副本返回
BiTree GetExchange(BiTree T);//交换二叉树左右子树并返回交换后的二叉树
int IsSimilar(BiTree T1,BiTree T2);//判断两个二叉树是否相似
int GetNodePosition(BiTree T,char c);//获取结点c在二叉树中所在层数

void main()
{
    char clear,c;
    BiTree T1,T2,copyT1;
    CreateBiTree(T1);
    scanf("%c",&clear);

    CreateBiTree(T2);
    scanf("%c",&clear);

    printf("Height:%d\n",GetTreeHeight(T1));
    printf("All Node:%d\n",GetAllNode(T1));
    printf("Zero Node:%d\n",GetZeroNode(T1));
    printf("One Node:%d\n",GetOneNode(T1));
    printf("Two Node:%d\n",GetTwoNode(T1));

    scanf("%c",&c);
    printf("%c at %d\n",c,GetNodePosition(T1,c));

    copyT1 = CopyBiTree(T1);

    if (IsSimilar(T1,T2))
    {
        printf("Similar!\n");
    }
    else
    {
        printf("No Similar!\n");
    }
}

void CreateBiTree(BiTree &T)
{
    char c;
    scanf("%c",&c);
    if (c == ' ')
        T = NULL;
    else
    {
        T = (BiNode *)malloc(sizeof(BiNode));
        T->data = c;
        CreateBiTree(T->LChild);
        CreateBiTree(T->RChild);
    }
}
int GetTreeHeight(BiTree T)
{
    int l,r;
    l = r = 0;
    if (T->LChild)    l = GetTreeHeight(T->LChild);
    if (T->RChild)    r = GetTreeHeight(T->RChild);
    if (T->LChild == NULL && T->RChild == NULL)    l=r=1;
    return l>r?l:r;
}
int GetAllNode(BiTree T)
{
    return T==NULL?0:(GetAllNode(T->LChild)+GetAllNode(T->RChild)+1);
}
int GetZeroNode(BiTree T)
{
    if (T==NULL)    return 0;
    return (T->LChild==NULL&&T->RChild==NULL)?1:(GetZeroNode(T->LChild)+GetZeroNode(T->RChild));
}
int GetOneNode(BiTree T)
{
    int i;
    if (T==NULL)    return 0;
    i = GetOneNode(T->LChild)+GetOneNode(T->RChild);
    if ((T->LChild||T->RChild) && !(T->LChild && T->RChild))    i++;
    return i;
}
int GetTwoNode(BiTree T)
{
    int i;
    if(T == NULL )    return 0;
    i = GetTwoNode(T->LChild)+GetTwoNode(T->RChild);
    if (T->LChild && T->RChild)    i++;
    return i;
}
BiTree CopyBiTree(BiTree T)
{
    BiTree cT;
    if (T == NULL)    return NULL;
    cT = (BiNode *)malloc(sizeof(BiNode));
    cT->data = T->data;
    cT->LChild = CopyBiTree(T->LChild);
    cT->RChild = CopyBiTree(T->RChild);
    return cT;
}
BiTree GetExchange(BiTree T)
{
    BiTree p;
    if(T == NULL)    return NULL;
    p = GetExchange(T->LChild);
    T->LChild = GetExchange(T->RChild);
    T->RChild = p;
    return T;
}
int IsSimilar(BiTree T1,BiTree T2)
{
    int l,r;
    if (T1 == NULL && T2 == NULL)    return 1;
    if (T1==NULL&&T2 || T1&&T2==NULL)    return 0;
    l = IsSimilar(T1->LChild,T2->LChild);
    r = IsSimilar(T1->RChild,T2->RChild);
    return l&&r?1:0;
}
int GetNodePosition(BiTree T,char c)
{
    int l=0,r=0;
    if (T->data == c)    return 1;
    if (T->LChild!=NULL)    l=GetNodePosition(T->LChild,c);
    if (T->RChild!=NULL)    r=GetNodePosition(T->RChild,c);
    return    l+r?l+r+1:0;
}