求二叉树的高度算法，谁会呀，救一下老弟啊求二叉树的高度算法

遍历一下就可以了
返回max(dfs(tree.left),dfs(tree.left))+1;

int node_depth(node_tp node, int * blance)
{
    int l, r;
    if(!node)
        return 0;
    l = node_depth(node->left, blance);
    r = node_depth(node->right,blance);
    if(blance && (l - r > 1 || l - r < -1))
    {
        *blance = 0;
        printf("\ncha=%d, %d", l-r, node->data);
    }
    return 1 + ((l > r)? l:r);
}

int depth(treenode *bt)
{
    if(bt==null)
       retrun 0;
    else
   {
   int dep1=depth(bt->letf);
   int dep2=depth(bt->right);
   if(dep1>dep2)
      return dep1+1;
   else
      return dep2+1;
   }

}