题意:依次输入n个数,比第一个节点小就放在左边,比较第一个节点的左儿子的值,如果还小,就在放到左边,就是二叉搜索树的思想
思路:数都是二叉搜索树那么存的,那找的时候肯定也是在树上面找了,模版题,不多解释
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const int maxn=100010;
struct Treap_Node{
Treap_Node *left,*right;
int value;
};
void Treap_Print(Treap_Node *P){//从小到大输出
if(P){
Treap_Print(P->left);
printf("%d\n",P->value);
Treap_Print(P->right);
}
}
int Treap_Find(Treap_Node *P,int value){//查找有没有value这个数
if(!P) return 0;
if(P->value==value) return 1;
else if(value<P->value) return Treap_Find(P->left,value);
else return Treap_Find(P->right,value);
}
void Treap_Insert(Treap_Node *&P,int value){//插入一个数
if(!P){
P=new Treap_Node;
P->left=P->right=NULL;//左右儿子均为空
P->value=value;
}
else if(value<=P->value) Treap_Insert(P->left,value);
else Treap_Insert(P->right,value);
}
int Find_Delete(Treap_Node *&P){
if(!P->left){
Treap_Node *t=P;
int r=P->value;
P=P->right;
delete t;
return r;
}else return Find_Delete(P->left);
}
void Treap_Delete(Treap_Node *&P,int value){//删除一个数
if(!P) return ;
if(P->value==value){
if(P->left&&P->right) P->value=Find_Delete(P->right);
else{
Treap_Node *t=P;
if(P->left) P=P->left;
else P=P->right;
delete t;
}
}else if(value<P->value) Treap_Delete(P->left,value);
else Treap_Delete(P->right,value);
}
void Treap_Found(Treap_Node *P,int k){
int t=P->value;
if(t==k) return ;
if(t>k){
printf("E");Treap_Found(P->left,k);
}else if(t<k){
printf("W");Treap_Found(P->right,k);
}
}
int main(){
int T,n,m,a,b;
scanf("%d",&T);
while(T--){
Treap_Node *root;
root=NULL;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a);
Treap_Insert(root,a);
}
scanf("%d",&m);
while(m--){
scanf("%d",&b);
Treap_Found(root,b);
printf("\n");
}
}
return 0;
}