hdu5444 Elven Postman 二叉树遍历

Elves are very peculiar creatures. As we all know, they can live for a very long time and their magical prowess are not something to be taken lightly. Also, they live on trees. However, there is something about them you may not know. Although delivering stuffs through magical teleportation is extremely convenient (much like emails). They still sometimes prefer other more “traditional” methods. 

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. 

题目大概意思就是给一个序列建立二叉树，左孩子小于根节点小于右孩子，然后给一组询问，问如何到达该节点。

直接建树+先序遍历即可

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
struct node
{
    int lchild,rchild;
    int x;
} tree[1005];
int path[1005];
int t,mz;
bool flag=0;
void insrt(int pos,int x)
{
    if(tree[pos].x>x)
    {
        if(tree[pos].lchild==0)
        {
            tree[pos].lchild=t;
            tree[t++].x=x;
        }
        else
            insrt(tree[pos].lchild,x);
    }
    else
    {
        if(tree[pos].rchild==0)
        {
            tree[pos].rchild=t;
            tree[t++].x=x;
        }
        else
            insrt(tree[pos].rchild,x);
    }
}
void dfs(int pos,int dep,int x)
{
	if(flag) return;
    if(tree[pos].x==x)
	{
		flag=1;
		mz=dep;
		return;
	}
    if(tree[pos].lchild)
    {
        path[dep]=1;
        dfs(tree[pos].lchild,dep+1,x);
    }
    if(flag) return;
    if(tree[pos].rchild)
    {
        path[dep]=2;
       dfs(tree[pos].rchild,dep+1,x);
    }
}
int main()
{
    int n,m,T,x;
    scanf("%d",&T);
    while(T--)
    {
    	memset(tree,0,sizeof(tree));
        t=0;
        scanf("%d",&n);
        scanf("%d",&x);
        tree[t++].x=x;
        for(int i=1; i<n; i++)
        {
            scanf("%d",&x);
            insrt(0,x);
        }
        //for(int i=0;i<t;i++)
        //	printf("%d %d %d %d\n",i,tree[i],tree[i].lchild,tree[i].rchild);
        scanf("%d",&m);
        for(int i=0; i<m; i++)
        {
        	flag=0;
        	scanf("%d",&x);
            dfs(0,0,x);
            for(int i=0; i<mz; i++)
            {
                printf("%c",path[i]==1?'E':'W');
            }
		    printf("\n");
        }
    }
    return 0;
}