c++二叉排序樹+中序遍曆

/* cpp 二叉排序樹   儘管二叉排序樹很簡單，但是第一次寫二叉排序樹的類，還是有一點的麻煩。   不知道如何寫遞迴，如何寫成員函數等。。。   第一次總是會很糾結的，所以發篇博文來紀念下自己寫的第一個C++類    BY Mr_Zys*/#include<iostream>#include<Cstring>#define MAXN 10000using namespace std;typedef struct Node{    char data[MAXN];    Node *l;    Node *r;}   Node,*pointNode;class BTree{     public:           BTree();           //void Creat();           void Insert(char *s);           void Query();           void Query(pointNode r);           pointNode Getroot();           ~BTree();     private:           pointNode root;};BTree::BTree(){     root=NULL;}void BTree::Insert(char *s){     if(root==NULL){       root=new Node;       strcpy(root->data,s);       root->l=NULL;       root->r=NULL;       return;     }     pointNode T=root,P;     while(T!=NULL){       if(strcmp(T->data,s)==0){          cout<<"REERO: Data has existed;"<<endl;          return;       }       P=T;       T=strcmp(T->data,s)>0?T->l:T->r;     }     T=new Node;     strcpy(T->data,s);     T->l=NULL;     T->r=NULL;     if(strcmp(P->data,s)>0) P->l=T;     if(strcmp(P->data,s)<0) P->r=T;     cout<<"Now is the root's data:"<<root->data<<endl;}pointNode BTree::Getroot(){     return root;}void BTree::Query(pointNode r){    if(r!=NULL){        Query(r->l);        cout<<r->data<<endl;        Query(r->r);    }}void BTree::Query(){    pointNode r;    r=Getroot();    Query(r);}BTree::~BTree(){}int main(){    BTree tree;    char s[MAXN];    while(1){        cout<<"Please Input The Information: ";        cin>>s;        if(s[0]=='#') break;        tree.Insert(s);    }    tree.Query();    return 0;}