求二叉树中叶子结点的个数

#include<iostream> #define N 63 using namespace std; char str[] = "ab#d##c#e##"; int i = -1; typedef struct node { struct node *leftChild; struct node *rightChild; char data; }BiTreeNode, *BiTre

>>阅读原文<<