是否为同一二叉搜索树

2
567432
543267
576342
0

YES
NO

#include <bits/stdc++.h>
using namespace std;

typedef struct TreeNode
{
    int data;
    TreeNode *lchild,*rchild;
}*Tree;
//利用队列来实现二叉树的层次遍历
void LevelOrder(Tree root,vector<int> &v)  
{
    v.clear();   //一定先清空容器
    queue<Tree> q;
    q.push(root);
    while(!q.empty())   //队列非空时
    {
        Tree bt = q.front();
        q.pop();
        v.push_back(bt->data);
        //将队首结点的左孩子结点入队列
        if(bt->lchild != NULL)
        {
            q.push(bt->lchild);
        }
        //将队首结点的右孩子结点入队列
        if(bt->rchild != NULL)
        {
            q.push(bt->rchild);
        }
    }
}

void Insert(Tree &root,int x)
{
    if(root == NULL)
    {
        root = new TreeNode;
        root->data = x;
        root->lchild = root->rchild = NULL;
    }
    else if(x < root->data)
    {
        Insert(root->lchild,x);
    }
    else
    {
        Insert(root->rchild,x);
    }
}

Tree Str2Tree(string s)     //根据字符串得到一棵树
{
    Tree bt = NULL;
    for (int i = 0; i < s.length(); ++i)
    {
        Insert(bt,s[i]);
    }
    return bt;
}

int main()
{
    int n;
    string str,temp;
    vector<int> a,b;
    while(cin >> n && n)
    {
        cin >> str;
        Tree bt = Str2Tree(str);
        LevelOrder(bt,a);
        for (int i = 0; i < n; ++i)
        {
            cin >> temp;
            Tree temp_bt = Str2Tree(temp);
            LevelOrder(temp_bt,b);
            if(a == b)
            {
                cout << "YES" << endl;
            }
            else
            {
                cout << "NO" << endl;
            }
        }
    }
    return 0;
}