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: Time Limit Exceeded)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX 500001

struct node{
  struct node *parent;
  struct node *left;
  struct node *right;
  int key;
};

typedef struct node Node;
Node *root,*NIL;

void Insert(int id){
  Node *x,*y,*z;
  y = NIL;
  x = root;

  z = (Node *)malloc(sizeof(Node));
  z->key = id;
  z->left = NIL;
  z->right = NIL;
  
  while(x!=NIL){
    y = x;
    if(z->key < x->key){
      x = x->left;
    }
    else{
      x = x->right;
    }
  }
  z->parent = y;

  if(y == NIL) root = z;
  else if(z->key < y->key) y->left = z;
  else y->right = z;
  
};
void Inorder(Node *id){
  if(id==NIL)return;

  Inorder(id->left);
  printf(" %d",id->key);

  Inorder(id->right);
};
void Preorder(Node *id){
  if(id==NIL)return;

  printf(" %d",id->key);
  
  Preorder(id->left);
  Preorder(id->right);
};
int Find(Node *id, int key){
  int count = 0;
  if(id==NIL){
    //printf("no\n");
    return 0;
  }
  if(key==id->key){
    //printf("yes\n");
    //count++;
    return 1;
  }
  
  count += Find(id->left,key);
  count +=  Find(id->right,key);
  return count;
  
};
int main(){

  int i,j,n,id,find,count=0,judge;
  char order[MAX];
  
  scanf("%d",&n);

  for(i=0;i<n;i++){ //parent
    scanf("%s",order);
    if(strcmp(order,"insert")==0){
      scanf("%d",&id);
      Insert(id);
    }
    else if(strcmp(order,"find")==0){
      scanf("%d",&find);
      judge = Find(root,find);
      if(judge == 1){
	printf("yes\n");
      }
      else{
	printf("no\n");
      }
    }
    else{
      Inorder(root);
      printf("\n");
      Preorder(root);
      printf("\n");
    }
  }

  return 0;
}