获取二叉树叶子数、高度及左右子树交换

typedef struct BNode
{
    char value;  //类型假设为char
    struct BNode *left;
    struct BNode *right;

} Node,*pNode,**ppNode;
int GetLeafeNum(pNode root)
{
    if(root==NULL)  //空节点叶子数为0
    {
        return 0;
    }
    else if(root->left==NULL&&root->right==NULL)
    {
       return 1;
    }
    return GetLeafeNum(root->left)+GetLeafeNum(root->right);
}

void swap_tree(pNode root)
{
    if(root==NULL)
        return;
    else
    {
        pNode temp=root->left;
        root->left=root->right;
        root->right=temp;
        swap_tree(root->left);
        swap_tree(root->right);
    }
}

int GetHeight(pNode root)
{
    if(root==NULL)
    {
        return 0;
    }
    //max(left,right)+1; 左右子树最高高度+1
    return (GetHeight(root->left)>=GetHeight(root->right)?(GetHeight(root->left)+1):(GetHeight(root->right)+1));
}