SDUT 3375 数据结构实验之查找三：树的种类统计

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 using namespace std;
 5 
 6 struct Tree
 7 {
 8     char name[24];
 9     int n;
10     Tree *lt,*rt;
11 };
12 
13 void insert(Tree *&root,char *e)
14 {
15     if(!root)
16     {
17         Tree *r=new Tree;
18         strcpy(r->name,e);
19         r->n=1;
20         r->lt=r->rt=NULL;
21         root=r;
22     }
23     else
24     {
25         int cmp=strcmp(e,root->name);
26         if(cmp<0)
27             insert(root->lt,e);
28         else if(cmp>0)
29             insert(root->rt,e);
30         else
31             root->n++;
32     }
33 }
34 
35 int n;
36 void mout(Tree *root)
37 {
38     if(root)
39     {
40         mout(root->lt);
41         printf("%s %.2f%%\n",root->name,root->n*100.0/n);
42         mout(root->rt);
43     }
44 }
45 
46 int main()
47 {
48     int t;
49     scanf("%d\n",&t);
50     n=t;
51     Tree *root=NULL;
52     while(t--)
53     {
54         char ch,e[24];
55         int i=0;
56         while(ch=getchar(),ch!=‘\n‘)
57         {
58             if(ch>=‘A‘&&ch<=‘Z‘)
59                 e[i]=ch+32;
60             else
61                 e[i]=ch;
62             i++;
63         }
64         e[i]=‘\0‘;
65         insert(root,e);
66     }
67     mout(root);
68     return 0;
69 }
70 
71 /***************************************************
72 User name: ***
73 Result: Accepted
74 Take time: 0ms
75 Take Memory: 156KB
76 Submit time: 2016-11-29 17:54:17
77 ****************************************************/