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)

using System;

class Program{
    class Node{
        public int key;
        public Node parent;
        public Node left;
        public Node right;
    }

    static void Insert(Node root, Node z){
        Node y=null;
        var x=root.left;
        while (x!=null) {
            y=x;
            if (z.key<x.key) {
                x=x.left;
            } else {
                x=x.right;
            }
        }
        z.parent=y;
        if (y==null) {
            root.left=z;
        } else if (z.key<y.key) {
            y.left=z;
        } else {
            y.right=z;
        }
    }

    static bool Find(Node node, int key){
        if (node.key==key) {
            return true;
        } else {
            if (node.key>key) {
                return node.left!=null && Find(node.left, key);
            } else {
                return node.right!=null && Find(node.right, key);
            }
        }
    }

    static void WalkPreorder(Node node){
        Console.Write(" "+node.key);
        if(node.left!=null){
            WalkPreorder(node.left);
        }
        if(node.right!=null){
            WalkPreorder(node.right);
        }
    }

    static void WalkInorder(Node node){
        if(node.left!=null){
            WalkInorder(node.left);
        }
        Console.Write(" "+node.key);
        if(node.right!=null){
            WalkInorder(node.right);
        }
    }

    public static void Main(){
        var m=int.Parse(Console.ReadLine());
        var root=new Node();
        for (var i=0; i<m; i++) {
            var s=Console.ReadLine().Split(' ');
            if (s[0][0]=='i') {
                var node=new Node();
                node.left=null;
                node.right=null;
                node.key=int.Parse(s[1]);
                Insert(root, node);
            } else if (s[0][0]=='f') {
                Console.WriteLine(Find(root.left, int.Parse(s[1])) ?
                        "yes" : "no");
            } else {
                WalkInorder(root.left);
                Console.WriteLine();
                WalkPreorder(root.left);
                Console.WriteLine();
            }
        }
    }
}