判断俩树是否相同

#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
struct TreeNode{
    int data;
    TreeNode* leftchild;
    TreeNode* rightchild;
};
TreeNode* Build(TreeNode* root,int x){
    if(root == NULL){
        root = new TreeNode();
        root->data = x;
        root->leftchild = NULL;
        root->rightchild = NULL;
    }else if(x < root->data){
        root->leftchild = Build(root->leftchild,x);
    }else{
        root->rightchild = Build(root->rightchild,x);
    }
    return root;
}
bool EqualTree(TreeNode* root1,TreeNode* root2){//判断两树结构和数值是否相同
    if(root1 == NULL && root2 == NULL){//两个都空
        return true;
    }else if(root1 == NULL || root2 == NULL){//一个空一个不空
        return false;
    }else {//两个都不空
        if(root1->data != root2->data){
            return false;
        }else{
            return EqualTree(root1->leftchild,root2->leftchild) && EqualTree(root1->rightchild,root2->rightchild);
        }
    }

}
int main(){
    int n;
    while(scanf("%d",&n) != EOF){
        string str1;
        cin>>str1;
        TreeNode* root1 = NULL;
        for(int i = 0;i < str1.size();i ++){
            root1 = Build(root1,str1[i]);
        }
        while(n--){
            string str2;
            cin >> str2;
            TreeNode* root2 = NULL;
            for(int i =0;i < str2.size();i++){
                root2 = Build(root2,str2[i]);
            }
            if(EqualTree(root1,root2)){
                printf("YES\n");
            }else{
                printf("NO\n");
            }

        }

    }
    return 0;
}