获取二叉树深度叶子数

#include <iostream>
using namespace std;
typedef struct node{
    char data;
    node *lchild,*rchild;
}binode,*bitree;
bitree createTree(bitree root)
{
    char ch;
    cin>>ch;
    if(ch=='#')
        root=NULL;
    else
    {
        root=new binode;
        root->data=ch;
        root->lchild=createTree(root->lchild);
        root->rchild=createTree(root->rchild);
    }
    return root;
}
void InOrderTraverse(bitree root)
{
    if(root!=NULL)
    {
        cout<<root->data<<" ";
        InOrderTraverse(root->lchild);
        InOrderTraverse(root->rchild);
    }
}
int depth(bitree root)
{
    int left=0,right=0 ;
    if(!root)
        return 0;
    else
    {
        right=depth(root->rchild);
        left=depth(root->lchild);
    }
    return right>left?right+1:left+1;
}
int count(bitree root)
{
    int n=0;
    if(!root)
        return 0;
    else if(root->lchild==NULL&&root->rchild==NULL)
        return 1;
    else
        n=count(root->lchild)+count(root->rchild);
    return n;
}
int main() 
{
    bitree root=NULL;
    root=createTree(root);
    InOrderTraverse(root);
    cout<<depth(root)<<endl;
    cout<<count(root)<<endl;
}