![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
![ExpandedBlockStart.gif](https://images.cnblogs.com/OutliningIndicators/ExpandedBlockStart.gif)
1 #include<iostream>
2 #include<cstdio>
3 #include<cstring>
4 using namespace std;
5 struct node{
6 char c;
7 int lchild,rchild;
8 }tree[ 30];
9
10 char str[ 100][ 27];
11 int n;
12 int add( int i, char ch)
13 {
14 if(ch<tree[i].c)
15 {
16 if(tree[i].lchild== 0)
17 {
18 tree[n].c=ch;
19 tree[i].lchild=n++;
20 return 0;
21 }
22 else add(tree[i].lchild,ch);
23 }
24 else{
25 if(tree[i].rchild== 0)
26 {
27 tree[n].c=ch;
28 tree[i].rchild=n++;
29 return 0;
30 }
31 else add(tree[i].rchild,ch);
32 }
33 return 0;
34 }
35
36 void print( int i)
37 {
38 cout<<tree[i].c;
39 if(tree[i].lchild) print(tree[i].lchild);
40 if(tree[i].rchild) print(tree[i].rchild);
41 }
42
43 int main()
44 {
45 int i,j,count;
46 while(cin>>str[ 0])
47 {
48 count= 0;
49 if(str[ 0][ 0]== ' $ ') break;
50 while(str[count][ 0]>= ' A '&&str[count][ 0]<= ' Z ')
51 {
52 cin>>str[++count];
53 }
54 count--;
55 memset(tree, 0, sizeof(tree));
56 n= 0;
57 tree[n++].c=str[count][ 0];
58 for(i=count- 1;i>= 0;i--)
59 {
60 for(j= 0;j<strlen(str[i]);j++)
61 add( 0,str[i][j]);
62 }
63 print( 0);
64 cout<<endl;
65 }
66 return 0;
67 }
2 #include<cstdio>
3 #include<cstring>
4 using namespace std;
5 struct node{
6 char c;
7 int lchild,rchild;
8 }tree[ 30];
9
10 char str[ 100][ 27];
11 int n;
12 int add( int i, char ch)
13 {
14 if(ch<tree[i].c)
15 {
16 if(tree[i].lchild== 0)
17 {
18 tree[n].c=ch;
19 tree[i].lchild=n++;
20 return 0;
21 }
22 else add(tree[i].lchild,ch);
23 }
24 else{
25 if(tree[i].rchild== 0)
26 {
27 tree[n].c=ch;
28 tree[i].rchild=n++;
29 return 0;
30 }
31 else add(tree[i].rchild,ch);
32 }
33 return 0;
34 }
35
36 void print( int i)
37 {
38 cout<<tree[i].c;
39 if(tree[i].lchild) print(tree[i].lchild);
40 if(tree[i].rchild) print(tree[i].rchild);
41 }
42
43 int main()
44 {
45 int i,j,count;
46 while(cin>>str[ 0])
47 {
48 count= 0;
49 if(str[ 0][ 0]== ' $ ') break;
50 while(str[count][ 0]>= ' A '&&str[count][ 0]<= ' Z ')
51 {
52 cin>>str[++count];
53 }
54 count--;
55 memset(tree, 0, sizeof(tree));
56 n= 0;
57 tree[n++].c=str[count][ 0];
58 for(i=count- 1;i>= 0;i--)
59 {
60 for(j= 0;j<strlen(str[i]);j++)
61 add( 0,str[i][j]);
62 }
63 print( 0);
64 cout<<endl;
65 }
66 return 0;
67 }