设树采用孩子兄弟表示法存放。用类C语言设计算法计算树的高度。跪求算法，谢谢！

Answer 1

如下
#define MAX(a,b) ( a > b ? a : b )

typedef struct BitNode{
BitNode *left;
BitNode *right;
Element data;
}BitNode, *pBitTree;

int getBitTreeDeep( pBitTree root ){
if( !root )
return 0;
return ( MAX( getBitTreeDeep( root->left ) , getBitTreeDeep( root->right ) ) + 1 );
}

Answer 2

int high(tree *T)
{
if(!T)return 0;
return max( high(T->l)+1, high(T->r));
}

Answer 3

int depth (Node *c,int d) {
if (c==NULL) return d-1;

return max(depth(c->left,d+1),depth(c->right,d+1));
}