anxious! How do you write a recursive algorithm for calculating the height of a given binary tree?

yumkyo

BTnode is defined as follows:
Typedef struct BTnode {
          TeleType data;
     struct Btnode * rchild, * lchild;}

Main program definition:
Int Deepth (BTnode * t)
Recursive program recommendations:
Int subth (BTNode * t)

菜鸟级高手

Int subth (BTNode * t)
{
  int l, r;
  if (! t)
    return 0;
  l = subth (t-> left);
  r = subth (t-> right);
  if (l <r)
    return r + 1;
  else
    return l + 1;
}

yashiroxyz

Positive solution upstairs!

ghwlhl

How come there is no separation between the main program and the recursive function program?

stoneboy4000

This is to ask the original poster what is "recursive program suggestion:...", typedef has never seen such
Work around:
Int Deepth(BTnode *t){
  return subth(t);
}
^_^