习题3-求二叉树深度.c

来自「数据结构各章实验源代码； 数据结构实验源代码」· C语言 代码 · 共 27 行

#include  <stdio.h>
#include  "datastru.h"
#include  <malloc.h>
#include  "二叉树.c"
 
int treehight(BTCHINALR *bt)
{	int lh, rh, h;

	if(bt == NULL)
		h = 0;
	else
	  {	lh = treehight(bt->lchild);
		rh = treehight(bt->rchild);
		h = (lh > rh ? lh : rh) + 1;	}
	return h;
}


main( )
{ BTCHINALR  *bt;
  int treeh;

 bt = createbt( );
 treeh = treehight(bt);
 printf("\n二叉树深度 =  %d\n\n",treeh);
}