习题2-求二叉树叶子结点.c

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

#include  <stdio.h>
#include  "datastru.h"
#include  <malloc.h>
#include  "二叉树.c"

int leaf(BTCHINALR *bt)
{   if(bt == NULL)	return 0;
	else  if(bt->lchild == NULL && bt->rchild == NULL)    return 1;
	      else   return(leaf(bt->lchild) + leaf(bt->rchild));
}

main( )
{ BTCHINALR  *bt;
  int  leafnum;

 bt = createbt( );
 leafnum = leaf(bt);
 printf("\n二叉树的叶子结点数 =  %d\n\n",leafnum);
}