if ((T->lchild->data=='#')&&(T->rchild->data=='#'))

count++; // 对叶子结点计数

CountLeaf( T->lchild, count);

CountLeaf( T->rchild, count);

}

int BiTreeDepth (BiTree T){

int ldepth,rdepth,depth;

if(T->data=='#') depth=0; } else{

ldepth=BiTreeDepth (T->lchild);

rdepth=BiTreeDepth (T->rchild);

}

void main(){

BiTree T;

int depth,count=0; InitBiTree(T); depth=1+(ldepth>rdepth?ldepth:rdepth);} return depth;

CreateBiTree(T);

cout<<"先序遍历:"; PreOrderTraverse ( T, visit); cout<<endl; cout<<"中序遍历:";

InOrderTraverse( T, visit);

cout<<endl; cout<<"后序遍历:"; PostOrderTraverse( T, visit);