7-24 树种统计 (25 分)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

typedef struct TNode *Position;
typedef Position BinTree;
struct TNode
{
    char data[35];
    BinTree left;
    BinTree right;
    int count;
};
BinTree Insert( BinTree BT , char name[]);
void Print( BinTree BT , int n);
int main()
{
    int n;
    int i;
    BinTree BT = NULL;

    scanf("%d",&n);
    getchar();
    for( i=0; i<n; i++){
        char name[35];
        gets(name);
        BT = Insert( BT,name);
    }
    Print( BT ,n);

    return 0;
}


BinTree Insert( BinTree BT , char name[])
{
    if( !BT ){
        BT = ( BinTree )malloc(sizeof(struct TNode));
        strcpy(BT->data,name);
        BT->count=1;
        BT->left = BT->right =NULL;
    }
    else{
        int a = strcmp( BT->data,name);
        if( a<0 )  BT->right = Insert( BT->right,name);

        else if( a>0 ) BT->left=Insert( BT->left,name);
        else BT->count++;
    }
    return BT;
}

void Print( BinTree BT , int n)
{
    if( !BT ) return;
    else{
        Print( BT->left,n);
        printf("%s ",BT->data);
        printf("%.4f%%\n",(double)BT->count/n*100.0);
        Print( BT->right,n);
    }
}