/*
author:ray007great
version:1.0
*/
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<time.h>
#include<queue>
using namespace std;
typedef long long ll;
//c++
#pragma comment(linker, "/STACK:102400000,102400000")
// g++
//int size = 256 << 20; // 256MB
//char *p = (char*)malloc(size) + size;
//__asm__("movl %0, %esp\n" :: "r"(p) );
#define sf(a) scanf("%d",&a)
#define sfs(a) scanf("%s",a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define repd(i,a,b) for(int i=(a);i>=(b);i--)
#define rep1(i,a,b) for(int i=(a);i<(b);i++)
#define clr(a) memset(a,0,sizeof(a))
#define clr1(a) memset(a,-1,sizeof(a))
#define pfk printf("fuck\n")
/* define */
/* clock */
//clock_t start, finish;
//start = clock();
//finish = clock();
//double duration = (double)(finish - start)/CLOCKS_PER_SEC;
//printf( "%.10f seconds\n", duration );
/* clock */
/* data */
/* data */
int cc;
char orz[25];
struct node{
int val;
struct node *left,*right;
};
void dfs(node *now,char* orz){
orz[cc++]=now->val;
if(now->left!=NULL) dfs(now->left,orz);
if(now->right!=NULL) dfs(now->right,orz);
if(now!=NULL) delete(now);
}
node* search(node* now,node* fa,int key){
if(now==NULL) return fa;
if(now->val>key) return search(now->left,now,key);
else return search(now->right,now,key);
}
char* getStr(char* s){
node* root=new node;
root=NULL;
for(int i=0;s[i];i++){
node* temp = new node;
temp->val=s[i];temp->left=NULL;temp->right=NULL;
node* now = search(root,root,s[i]);
if(now==NULL) root = temp;
else if(now->val>temp->val) now->left=temp;
else now->right=temp;
}
cc=0;
dfs(root,orz);
orz[cc]='\0';
return orz;
}
bool _strcmp(char* s1,char* s2){
int len1=strlen(s1);
int len2=strlen(s2);
if(len1!=len2) return false;
for(int i=0;s1[i];i++){
if(s1[i]!=s2[i]) return false;
}
return true;
}
int main(){
int n;
while(scanf("%d",&n) && n){
char s[25],std[25];
scanf("%s",s);
char* now=getStr(s);
strcpy(std,now);
//printf("%s\n",std);
for(int i=1;i<=n;i++){
scanf("%s",s);
now=getStr(s);
if(_strcmp(std,now)){
printf("YES\n");
}
else
printf("NO\n");
}
}
return 0;
}
xmu 1498 二叉搜索树(手写指针版二叉搜索树)
最新推荐文章于 2022-10-13 11:53:05 发布