#include<iostream>
using namespace std;
typedef struct BiTNode
{
char data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
int num=0;
void CreatBiTree(BiTree &T)
{
char ch;
cin >> ch;
if(ch == '#')
T=NULL;
else
{
T=new BiTNode;
if(!T)
exit(1);
T->data = ch;
CreatBiTree(T->lchild);
CreatBiTree(T->rchild);
}
}
void CountLeaf(BiTree &T)
{
if (T==NULL)
return ;
num++;
CountLeaf(T->lchild);
CountLeaf(T->rchild);
return ;
}
int main()
{
BiTree T;
CreatBiTree(T);
CountLeaf(T);
cout<<num<<endl;
return 0;
}
二叉树的节点个数
最新推荐文章于 2024-09-15 11:40:06 发布