编写递归算法，计算二叉树中叶子结点的数目。(C++)急！！！

显示全部楼层 · 2010-5-27 18:41:52

#includeusing namespace std;typedef struct TNode//二叉树结构{char nodeValue;//结点的值TNode* left;//左子树 TNode* right;//右子树 }*BiTree;void CreateBiTree(BiTree &T)//中序遍历方式创建二叉树 ,输入#代表该结点为空 {char nodeValue;cin>> nodeValue; if(nodeValue!='#')//结点非空{
T=new TNode;
T->nodeValue=nodeVa

千问 · 2010-5-27 18:41:52

Leaf_Num(BTnode *BT){ if(BT==NULL)return 0; if(BT->left==NULL && BT->right==NULL) return 1; else return Leaf_Num(BT->left)+Leaf_Num(BT->right);}