求二叉樹中葉子結點的個數

#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

>>阅读原文<<