数据结构实验之二叉树七：叶子问题

#include <stdio.h>
#include <stdlib.h>
#include <queue>
#include <iostream>

using namespace std;
char s[101];

struct Node
{
char data;
struct Node * lchild,* rchild;
};
struct Node * root;
int cnt;
//构造二叉树
struct Node * Build_tree()
{
struct Node * root;
if(s[cnt++] == ',') root = NULL;
else
{
root = (struct Node *)malloc(sizeof(struct Node));
root -> data = s[cnt - 1];
root -> lchild = Build_tree();
root -> rchild = Build_tree();
}
return root;
}
void yeziwenti(Node *root) //叶子节点
{
queue<Node*>s;
s.push(root);
while(!s.empty())
{
root = s.front();
s.pop();
if(root)
{
if((root->lchild==NULL) && (root->rchild==NULL))
printf("%c", root->data);
s.push(root->lchild);
s.push(root->rchild);
}
}
}

int main()
{
int n;
while(scanf("%s",s)!=EOF)
{
cnt = 0;
root = Build_tree(); //建树
yeziwenti(root);
cout<<endl;
}

return 0;
}