poj 2418 Hardwood Species（二叉排序树||map迭代器）

题目：http://poj.org/problem?id=2418

二叉排序树：

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;
int n=0;
typedef struct node
{
    char s[31];
    int num;
    struct node *lchild;
    struct node *rchild;
}btreenode,*btree;
void insert(btree *root,char str[])
{
    btreenode *p=*root,*f;
    while(p!=NULL)
    {
        if(strcmp(p->s,str)==0)
        {
            p->num++;
            return ;
        }
        f=p;
        if(strcmp(str,p->s)<0)
        p=p->lchild;
        else
        p=p->rchild;
    }
    p=(btree )malloc(sizeof(btreenode));
    p->num=1;
    strcpy(p->s,str);
    p->lchild=NULL;
    p->rchild=NULL;
    if((*root)==NULL)
    {
        (*root)=p;
    }
    else
    {
        if(strcmp(f->s,str)<0)
        {
            f->rchild=p;
        }
        else
        {
            f->lchild=p;

        }
    }
    return ;
}
void bianli(btree p)
{
     if(p!=NULL)
     {
         bianli(p->lchild);
         printf("%s %.4f\n",p->s,p->num*100.0/n);
         bianli(p->rchild);
     }
     return ;
}
int main()
{
    btree root;
    char str[31];
    root=NULL;
    while(gets(str)!=NULL)
    {
        n++;
        insert(&root,str);
    }
    bianli(root);
    return 0;
}

map迭代器：

#include <iostream>
#include<string>
#include<map>
#include<iterator>
#include<cstdio>
using namespace std;

int main()
{
    string str;
    int sum=0;
    map<string,int>tree;
    while(getline(cin,str))
    {
        tree[str]++;
        sum++;
    }
    map<string,int>::iterator iter;
    for(iter=tree.begin();iter!=tree.end();iter++)
    {
        cout<<iter->first;
        printf(" %.4f\n",iter->second*100.0/sum);
    }
    return 0;
}