Elven Postman
So, as a elven postman, it is crucial to understand how to deliver the mail to the correct room of the tree. The elven tree always branches into no more than two paths upon intersection, either in the east direction or the west. It coincidentally looks awfully like a binary tree we human computer scientist know. Not only that, when numbering the rooms, they always number the room number from the east-most position to the west. For rooms in the east are usually more preferable and more expensive due to they having the privilege to see the sunrise, which matters a lot in elven culture.
Anyways, the elves usually wrote down all the rooms in a sequence at the root of the tree so that the postman may know how to deliver the mail. The sequence is written as follows, it will go straight to visit the east-most room and write down every room it encountered along the way. After the first room is reached, it will then go to the next unvisited east-most room, writing down every unvisited room on the way as well until all rooms are visited.
Your task is to determine how to reach a certain room given the sequence written on the root.
For instance, the sequence 2, 1, 4, 3 would be written on the root of the following tree.
Input
First you are given an integer T(T≤10)T(T≤10)indicating the number of test cases.
For each test case, there is a number n(n≤1000)n(n≤1000)on a line representing the number of rooms in this tree. nn integers representing the sequence written at the root follow, respectively a1,...,ana1,...,an where a1,...,an∈{1,...,n}a1,...,an∈{1,...,n}.
On the next line, there is a number qqrepresenting the number of mails to be sent. After that, there will be qq integers x1,...,xqx1,...,xqindicating the destination room number of each mail.OutputFor each query, output a sequence of move (EE or WW) the postman needs to make to deliver the mail. For that EE means that the postman should move up the eastern branch and WW the western one. If the destination is on the root, just output a blank line would suffice.
Note that for simplicity, we assume the postman always starts from the root regardless of the room he had just visited.Sample
Input
2 4 2 1 4 3 3 1 2 3 6 6 5 4 3 2 1 1 1
Sample Output
E WE EEEEE
解题思路：
本题有多组数据，每组数据包含第一行结点数量，第二行结点权值，第三行目标点数量，第行目标点权值要求建立二叉搜索树后，在树中查找目标点输出查找路径，查找左子树输出E，查找右子树输出W，若目标点为根结点输出一个空行。
样例解析：
2 //测试组数
4 //二叉搜索树结点数量（第一组）
2 1 4 3 //二叉搜索树结点权值（第一组） //所建树前序遍历2 1 4 3
3 //目标点数量（第一组）
1 2 3 //目标点权值（第一组） //输出1:E 2:空行 3:WE
6 //二叉搜索树结点数量（第二组）
6 5 4 3 2 1 //二叉搜索树结点权值（第二组） //所建树前序遍历6 5 4 3 2 1
1 //目标点数量（第二组）
1 //目标点权值（第二组） //输出1:EEEEE
1 #include <bits/stdc++.h> 2 using namespace std; 3 typedef int dataType; 4 vector<int> arrayn; 5 vector<int> pattern; 6 struct node{ 7 dataType data; 8 node *leftChild; 9 node *rightChild; 10 node(){ 11 data = 0; 12 leftChild = NULL; 13 rightChild = NULL; 14 } 15 }; 16 void searchBST(node *root, dataType x){ //查找 17 if(root == NULL){ //找到空位置查找失败返回 18 return; 19 } 20 if(root->data == x){ //找到目标点换行 21 printf("n"); 22 }else if(root->data > x){ //x比根结点数据域小 查找左子树输出E 23 printf("E"); 24 searchBST(root->leftChild, x); //x比根结点数据域大 查找右子树输出W 25 }else if(root->data < x){ 26 printf("W"); 27 searchBST(root->rightChild, x); 28 } 29 } 30 void insertBST(node *&root, dataType x){ //插入 31 if(root == NULL){ //找到空位置即使插入位置 32 root = new node(); //新建结点权值为x 33 root->data = x; 34 return; 35 } 36 if(x == root->data){ //要插入结点已存在直接返回 37 return; 38 } 39 else if(root->data > x){ //x比根结点数据域小 需要插在左子树 40 insertBST(root->leftChild, x); 41 } 42 else if(root->data < x){ //x比根结点数据域大 需要插在右子树 43 insertBST(root->rightChild, x); 44 } 45 } 46 node *createBST(){ //以arrayn中记录的结点建树 47 node *root = NULL; 48 for(vector<int>::iterator it = arrayn.begin(); it != arrayn.end(); it++){ 49 insertBST(root, *it); 50 } 51 return root; 52 } 53 /*void preorder(node *root){ 54 if(root == NULL) 55 return; 56 printf("%d", root->data); 57 preorder(root->leftChild); 58 preorder(root->rightChild); 59 }*/ 60 int main() 61 { 62 int t; //测试组数 63 while(scanf("%d", &t) != EOF){ 64 int n; //二叉搜索树结点数量和目标点数量 65 while(t--){ 66 arrayn.clear(); //清空储存结点权值的容器 67 scanf("%d", &n); //输入结点数 68 int temp; 69 for(int i = 0; i < n; i++){ 70 scanf("%d", &temp); //输入权值 71 arrayn.push_back(temp); //将权值储存在arrayn中 72 } 73 node *root = NULL; 74 root = createBST(); //建树 75 //preorder(rood); 76 scanf("%d", &n); //输入目标点数量 77 for(int i = 0; i < n; i++){ 78 scanf("%d", &temp); //输入目标点权值 79 searchBST(root, temp); //查找并输出路径 80 } 81 } 82 } 83 return 0; 84 }
- 还没有人评论，欢迎说说您的想法！
客服
