刚学会数据结构中数字的二叉排序树构造，但是不知道字符串的该怎么构造，比如输入一串英语单词然后以各单词为结点形成二叉排序树，烦请各位高手指教，最好能给几行简单的代码，谢谢大家！

template<class T>
class BST;
template<class T>
class BSTnode
{
    friend class BST<T>;
private:
    T info;
    BSTnode<T> *LeftChild;//左子树
    BSTnode<T> *RightChild;//右子树
public:
    BSTnode()
    {
        LeftChild=RightChild=NULL;
    }
    BSTnode(const T &ele)
    {
        info=ele;
        LeftChild=RightChild=0;
    }
    BSTnode(const T &ele,BSTnode<T>*l,BSTnode<T>*r)
    {
        info=ele;
        LeftChild=l;
        RightChild=r;
    }
};

节点类的定义

哥能不能用简单C指导一下啊，呵呵

c我就不会了……不好意思

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

#define MAX_LEN    10

struct BST
{
    char data[MAX_LEN];
    struct BST *lch, *rch;
};

void insert( struct BST **tree, char temp[MAX_LEN] )
{
    struct BST *p = *tree;

    if( p == NULL )
    {
        *tree = (struct BST *) malloc (sizeof(struct BST));
        strcpy( (*tree)->data, temp );
        (*tree)->rch = (*tree)->lch = NULL;
        return;
    }
    while( 1 )
    {
        if( strcmp( p->data, temp ) > 0 )
        {
            if( p->lch == NULL )
            {
                p->lch = (struct BST *) malloc (sizeof(struct BST));
                strcpy( p->lch->data, temp );
                p->lch->lch = p->lch->rch = NULL;
                return;
            }
            else
            {
                p = p->lch;
            }
        }
        else
        {
            if( p->rch == NULL )
            {
                p->rch = (struct BST *) malloc (sizeof(struct BST));
                strcpy( p->rch->data, temp );
                p->rch->lch = p->rch->rch = NULL;
                return;
            }
            else
            {
                p = p->rch;
            }
        }
    }
}

void print( struct BST *tree )
{
    if( tree )
    {
        printf("%s ", tree->data );
        print( tree->lch);
        print( tree->rch);
    }

    return;
}


int main(void)
{
    struct BST *tree = NULL;
    char temp[MAX_LEN];

    while( scanf("%s", temp) )
    {
        insert(&tree, temp);
    }
    print(tree);
    printf("\n");

    return 0;
}

xiexie a