/*
这是一道模板题主要考查两个知识点:
1.构建二叉搜索树
2.由于二叉搜索树的性质 :先序遍历为最小序列
*/
#include <bits/stdc++.h>
using namespace std;
int n;
string s, s1;
struct node {
int value;
node* l, * r;
node(int value = 0, node* l = NULL, node* r = NULL) :value(value), l(l), r(r) {}
};
void insert(node *&root,int value) {
if (root == NULL) {
root = new node(value);
return;
}
else {
if (root->value > value) {
insert(root->l, value);
}
else if (root->value < value) {
insert(root->r, value);
}
}
}
void Build(node * &root,string s) {
for (int i = 0; i < s.size(); i++) {
insert(root, s[i]-'0');
}
}
int count1=0;
int pre_[12];
void pre(node *root) {
if (root != NULL) {
pre_[count1++] = root->value;
pre(root->l);
pre(root->r);
}
}
int count2=0;
int in_[12];
void in(node *root) {
if (root != NULL) {
in(root->l);
in_[count2++] = root->value;
in(root->r);
}
}
bool checked(node* root1, node* root2) {
count1 = 0;
count2 = 0;
memset(pre_, 0, sizeof(pre_));
memset(in_, 0, sizeof(in_));
int p[12],i[12];
pre(root1);
memcpy(p, pre_, sizeof(pre_));
count1 = 0;
pre(root2);
if (memcmp(p, pre_, sizeof(pre_)) != 0) return false;
in(root1);
memcpy(i, in_, sizeof(in_));
count2 = 0;
in(root2);
if (memcmp(i, in_, sizeof(in_)) != 0) return false;
return true;
}
int main()
{
while (cin >> n && n != 0) {
cin >> s;
node* root = NULL;
Build(root, s);
while (n--) {
node* root1 = NULL;
cin >> s1;
Build(root1, s1);
if (checked(root, root1))
cout << "YES";
else {
cout << "NO";
}
cout << endl;
}
}
return 0;
}
写繁琐了:
二叉搜索树的特殊性质导致只比较前序就可以判断是否相等