#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct node
{
char date;
struct node *l,*r;
}node,*tree;
int i;
char a[100];
tree creat()
{
char ch;
tree t;
ch=a[i];
i++;
if(ch==',')
{
t=NULL;
}
else
{
t=(tree)malloc(sizeof(tree));
t->date=ch;
t->l=creat();
t->r=creat();
}
return t;
}
void show(tree t)
{
tree p[100];
int n=0,m=0;
p[n]=t;
n++;
while(n>m)
{
if(p[m])
{
if(p[m]->l==NULL&&p[m]->r==NULL)
{
printf("%c",p[m]->date);
}
p[n]=p[m]->l;
n++;
p[n]=p[m]->r;
n++;
}
m++;
}
}
int main()
{
tree t;
while(gets(a))
{
i=0;
t=creat();
show(t);
printf("\n");
}
return 0;
}
#include <stdlib.h>
#include <string.h>
typedef struct node
{
char date;
struct node *l,*r;
}node,*tree;
int i;
char a[100];
tree creat()
{
char ch;
tree t;
ch=a[i];
i++;
if(ch==',')
{
t=NULL;
}
else
{
t=(tree)malloc(sizeof(tree));
t->date=ch;
t->l=creat();
t->r=creat();
}
return t;
}
void show(tree t)
{
tree p[100];
int n=0,m=0;
p[n]=t;
n++;
while(n>m)
{
if(p[m])
{
if(p[m]->l==NULL&&p[m]->r==NULL)
{
printf("%c",p[m]->date);
}
p[n]=p[m]->l;
n++;
p[n]=p[m]->r;
n++;
}
m++;
}
}
int main()
{
tree t;
while(gets(a))
{
i=0;
t=creat();
show(t);
printf("\n");
}
return 0;
}