//二叉搜索树的插入 
#include<iostream>
#include<cstdlib>
using namespace std;
struct node{
	int key;
	node *p,*l,*r;
};
node *root,*nil;
void Insert(int key)
{
	node *tt=(node*)malloc(sizeof(node));
	tt->key=key;
	tt->l=nil;
	tt->r=nil;
	node *t=root;   //  x
	node *y=nil; 
	while(t!=nil)
	{
		y=t;
		if(tt->key<t->key)
			t=t->l;
		else
			t=t->r;
	}
	tt->p=y;
	if(y==nil)
		root=tt;
	else
	{
		if(tt->key<y->key)
		{
			y->l=tt;
		}
		else
			y->r=tt;
	}
}

void Preorder(node* u)
{
	if(u==nil)
		return;
	cout<<" "<<u->key;
	Preorder(u->l);
	Preorder(u->r);
}

void Inorder(node* u)
{
	if(u==nil)
		return;
	Inorder(u->l);
	cout<<" "<<u->key;
	Inorder(u->r); 
}
bool find(int key)
{
	node *tt=root;
	while(tt!=nil&&tt->key!=key)
	{
		if(tt->key<key)
			tt=tt->r;
		else
			tt=tt->l;
	}	
	if(tt!=nil)
		return 1;
	else 
		return 0;
		
} 
int main()
{
	int n;
	cin>>n;
	while(n--)
	{
		string s;
		cin>>s;
		if(s[0]=='i')
		{
			int num;
			cin>>num;
			Insert(num);
		}
		else if(s[0]=='f')
		{
			int nn;
			cin>>nn;
			if(find(nn))
				cout<<"yes"<<endl;
			else
				cout<<"no"<<endl;
		}
		else{
			Inorder(root);
			cout<<endl;
			Preorder(root);
			cout<<endl;
		}	
	} 
	return 0;
}

### Prompt

Your challenge is to write a cpp solution to the following problem:

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.

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.

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.

Example

Input

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


Output

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

### Response

```cpp
//二叉搜索树的插入 
#include<iostream>
#include<cstdlib>
using namespace std;
struct node{
	int key;
	node *p,*l,*r;
};
node *root,*nil;
void Insert(int key)
{
	node *tt=(node*)malloc(sizeof(node));
	tt->key=key;
	tt->l=nil;
	tt->r=nil;
	node *t=root;   //  x
	node *y=nil; 
	while(t!=nil)
	{
		y=t;
		if(tt->key<t->key)
			t=t->l;
		else
			t=t->r;
	}
	tt->p=y;
	if(y==nil)
		root=tt;
	else
	{
		if(tt->key<y->key)
		{
			y->l=tt;
		}
		else
			y->r=tt;
	}
}

void Preorder(node* u)
{
	if(u==nil)
		return;
	cout<<" "<<u->key;
	Preorder(u->l);
	Preorder(u->r);
}

void Inorder(node* u)
{
	if(u==nil)
		return;
	Inorder(u->l);
	cout<<" "<<u->key;
	Inorder(u->r); 
}
bool find(int key)
{
	node *tt=root;
	while(tt!=nil&&tt->key!=key)
	{
		if(tt->key<key)
			tt=tt->r;
		else
			tt=tt->l;
	}	
	if(tt!=nil)
		return 1;
	else 
		return 0;
		
} 
int main()
{
	int n;
	cin>>n;
	while(n--)
	{
		string s;
		cin>>s;
		if(s[0]=='i')
		{
			int num;
			cin>>num;
			Insert(num);
		}
		else if(s[0]=='f')
		{
			int nn;
			cin>>nn;
			if(find(nn))
				cout<<"yes"<<endl;
			else
				cout<<"no"<<endl;
		}
		else{
			Inorder(root);
			cout<<endl;
			Preorder(root);
			cout<<endl;
		}	
	} 
	return 0;
}

```