编写递归算法，计算二叉树中叶子结点的数目

  #include<stdio.h>spa struct BiTree{get     char data;input     struct BiTree *lchild;io     struct BiTree *rchild;di };while struct BiTree* CreatBiTree(){data     char x;return     struct BiTree* p;

>>阅读原文<<