二叉树的叶子结点数及深度

#include<stdio.h>
#include<malloc.h>
struct node
{char data;
struct node *lchild,*rchild;
}bnode;
typedef struct node *blink;
int n=0,no=0;

void preorder(blink bt)
{
if(bt)
{n++;
if(bt->lchild==NULL&&bt->rchild==NULL)
no++;
preorder(bt->lchild);
preorder(bt->rchild);
}
}

int Depth(blink bt)
{int depthval,depthLeft,depthRight;
if(!bt) depthval=0;
else {
depthLeft=Depth(bt->lchild);
depthRight=Depth(bt->rchild);
depthval=1+(depthLeft>depthRight?depthLeft:depthRight);
}
return depthval;
}