二叉树2（动态创建）

#include"iostream"
#include"queue"
using namespace std;
typedef int element;
class Tree{
private:
    element data;
    Tree *left;
    Tree *right;
public:
    Tree(element data = 0){
        this->data = data;
        left = NULL;
        right = NULL;
    }
    void showsq(){
        queue<Tree*> q;
        q.push(this);
        while(!q.empty()){
            Tree *p = q.front();
            cout<<p->data<<ends;
            if(p->left){
                q.push(p->left);
            }
            if(p->right){
                q.push(p->right);
            }
            q.pop();
        }
    }
    void dynamicCreate(Tree* &t,int data,char *pos,int i = 0){
        if(!t){
            t = new Tree();
        }
        if(pos[i] == ‘)‘){
            t->data = data;
        }
        else if(pos[i] == ‘L‘){
            dynamicCreate(t->left,data,pos,i + 1);
        }
        else if(pos[i] == ‘R‘){
            dynamicCreate(t->right,data,pos,i + 1);
        }
        else{
            return ;
        }
    }
};

int main(){
    void pickup(char *s,int &data,char* position);        
    Tree *t = NULL;
    int data;
    char position[20],str[50];
    while(true){
        cin>>str;
        if(str[1] == ‘)‘){
            break;
        }
        pickup(str,data,position);        //提取信息
        t->dynamicCreate(t,data,position);
    }
    t->showsq();
    return 0;
}

void pickup(char *s,int &data,char* position){
        data = atoi(&s[1]);
        char *pos = strchr(s,‘,‘) + 1;
        strcpy(position,pos);
}
//(11,LL) (7,LLL) (8,R) (5,) (4,L) (13,RL) (2,LLR) (1,RRR) (4,RR) ()
//(11,LL) (7,LLL) (8,R)
//(12,R) (2,LLR) ()