Problem:
Binary Search Tree II

Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.

insert $k$: Insert a node containing $k$ as key into $T$.

find $k$: Report whether $T$ has a node containing $k$.

print: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.

Input

In the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$ or print are given.

Output

For each find $k$ operation, print "yes" if $T$ has a node containing $k$, "no" if not.

In addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key.

Constraints

The number of operations $\leq 500,000$

The number of print operations $\leq 10$.

$-2,000,000,000 \leq key \leq 2,000,000,000$

The height of the binary tree does not exceed 100 if you employ the above pseudo code.

The keys in the binary search tree are all different.

Sample Input 1

10
insert 30
insert 88
insert 12
insert 1
insert 20
find 12
insert 17
insert 25
find 16
print

Sample Output 1

yes
no
1 12 17 20 25 30 88
30 12 1 20 17 25 88

Reference

Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.

Solution in C (judge verdict: Accepted)

#include <stdio.h>
#include <string.h>
#define N 10000000

void insert(int);
void inorder(int);
void preorder(int);
int find(int, int);

typedef struct{
  int k, r, l;
}Node;

Node T[N+1];
int M;

void insert(int x){
  int n = 0;
  while(1){
    if(x < T[n].k){
      if(T[n].l == -1){
        T[n].l = M;
        T[M++].k = x;
        break;
      }
      else n = T[n].l;
    }
    else{
      if(T[n].r == -1){
        T[n].r = M;
        T[M++].k = x;
        break;
      }
      else n = T[n].r;
    }
  }
}

void inorder(int n){
  if(T[n].l != -1){
    inorder(T[n].l);
  }
  printf(" %d", T[n].k);
  if(T[n].r != -1){
    inorder(T[n].r);
  }
}

void preorder(int n){
  printf(" %d",T[n].k);
  if(T[n].l != -1){
    preorder(T[n].l);
  }
  if(T[n].r != -1){
    preorder(T[n].r);
  }
}

int find(int n, int x){
  if(T[n].k == x) return 1;
  if(x < T[n].k && T[n].l != -1){
      if(find(T[n].l, x)) return 1;
    }
    if(T[n].k < x && T[n].r != -1){
      if(find(T[n].r, x)) return 1;
    }
    return 0;
}

int main(){
  int n, i, x, in, first=1;
  char str[100];

  scanf("%d",&n);

  for(i=0; i<=n; i++){
    T[i].k = T[i].l = T[i].r = -1;
  }
  M = 0;
  while(n--){
    scanf("%s",str);
    if(!strcmp(str, "insert")){
      scanf("%d", &x);
      if(first){
        T[M++].k = x;
        first = 0;
      }
      else insert(x);
    }
    else if(!strcmp(str, "find")){
      scanf("%d", &in);
      if(find(0., in) == 1) printf("yes\n");
      else printf("no\n");
    }
    else{
      inorder(0);
      printf("\n");
      preorder(0);
      printf("\n");
    }
  }
  return 0;
}