//树深度算法 int BTNodeDepth(BTNode *b) { int lchilddep,rchilddep; if(b==NULL) return 0; else { lchilddep=BTNodeDepth(b->lchild); rchilddep=BTNodeDepth(b->rchild); return (lchilddep>rchilddep) ? (lchilddep+1):(rchilddep+1); } }