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;
using System.Collections.Generic;
using System.Text;

class Program
{

    public void Proc()
    {
        int cmdCount = int.Parse(Console.ReadLine());
        TreeNd root = null;

        for (int i = 0; i < cmdCount; i++)
        {
            string[] inpt = Console.ReadLine().Split(' ');
            if (inpt[0].Equals("print"))
            {
                this.GetInorderText(root);
                Console.WriteLine(string.Empty);
                this.GetPreorderText(root);
                Console.WriteLine(string.Empty);
            }
            else if (inpt[0].Equals("find"))
            {
                long target = long.Parse(inpt[1]);
                TreeNd parent = root;
                bool isFinded = false;
                for (int j = 0; j < cmdCount; j++)
                {
                    if (parent == null)
                    {
                        break;
                    }
                    if (parent.NodeId == target)
                    {
                        isFinded = true;
                        break;
                    }
                    else if (parent.NodeId < target)
                    {
                        parent = parent.RightChild;
                    }
                    else
                    {
                        parent = parent.LeftChild;
                    }
                }
                Console.WriteLine(isFinded ? "yes" : "no");
            }
            else
            {
                long num = long.Parse(inpt[1]);
                if (root == null)
                {
                    root = new TreeNd(num);
                }
                else
                {
                    TreeNd target = root;
                    for (int j = 0; j < cmdCount; j++)
                    {
                        if (target.NodeId > num)
                        {
                            if (target.LeftChild == null)
                            {
                                target.LeftChild = new TreeNd(num);
                                target.LeftChild.Parent = target;
                                break;
                            }
                            else
                            {
                                target = target.LeftChild;
                            }
                        }
                        else
                        {
                            if (target.RightChild == null)
                            {
                                target.RightChild = new TreeNd(num);
                                target.RightChild.Parent = target;
                                break;
                            }
                            else
                            {
                                target = target.RightChild;
                            }
                        }
                    }
                }
            }

        }
        // ????????????

    }

    private void GetPreorderText(TreeNd root)
    {
        Console.Write(" " + root.NodeId);
        if (root.LeftChild != null)
        {
            this.GetPreorderText(root.LeftChild);
        }
        if (root.RightChild != null)
        {
            this.GetPreorderText(root.RightChild);
        }
    }

    private void GetInorderText(TreeNd root)
    {
        if (root.LeftChild != null)
        {
            this.GetInorderText(root.LeftChild);
        }
        Console.Write(" " + root.NodeId);
        if (root.RightChild != null)
        {
            this.GetInorderText(root.RightChild);
        }
    }

    public class TreeNd
    {
        public TreeNd Parent;
        public long NodeId;
        public TreeNd LeftChild;
        public TreeNd RightChild;


        public TreeNd(long nodeid)
        {
            this.NodeId = nodeid;
        }


    }


    static void Main(string[] args)
    {
        Program prg = new Program();
        prg.Proc();
    }
}