Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Binary Search Tree I

Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.

Binary search tree is one of fundamental search trees. The keys in a binary search tree are always stored in such a way as to satisfy the following binary search tree property:

Let $x$ be a node in a binary search tree. If $y$ is a node in the left subtree of $x$, then $y.key \leq x.key$. If $y$ is a node in the right subtree of $x$, then $x.key \leq y.key$.

The following figure shows an example of the binary search tree.

For example, keys of nodes which belong to the left sub-tree of the node containing 80 are less than or equal to 80, and keys of nodes which belong to the right sub-tree are more than or equal to 80. The binary search tree property allows us to print out all the keys in the tree in sorted order by an inorder tree walk.

A binary search tree should be implemented in such a way that the binary search tree property continues to hold after modifications by insertions and deletions. A binary search tree can be represented by a linked data structure in which each node is an object. In addition to a key field and satellite data, each node contains fields left, right, and p that point to the nodes corresponding to its left child, its right child, and its parent, respectively.

To insert a new value $v$ into a binary search tree $T$, we can use the procedure insert as shown in the following pseudo code. The insert procedure is passed a node $z$ for which $z.key = v$, $z.left = NIL$, and $z.right = NIL$. The procedure modifies $T$ and some of the fields of $z$ in such a way that $z$ is inserted into an appropriate position in the tree.

1 insert(T, z)
2 y = NIL // parent of x
3 x = 'the root of T'
4 while x ≠ NIL
5 y = x // set the parent
6 if z.key < x.key
7 x = x.left // move to the left child
8 else
9 x = x.right // move to the right child
10 z.p = y
11
12 if y == NIL // T is empty
13 'the root of T' = z
14 else if z.key < y.key
15 y.left = z // z is the left child of y
16 else
17 y.right = z // z is the right child of y

Write a program which performs the following operations to a binary search tree $T$.

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

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

You should use the above pseudo code to implement the insert operation. $T$ is empty at the initial state.

Input

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

Output

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

8
insert 30
insert 88
insert 12
insert 1
insert 20
insert 17
insert 25
print

Sample Output 1

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 Ruby (judge verdict: Wrong Answer)

class BinSearchTree
  attr_accessor :node
  def initialize()
    @node = []
  end
  def preorder(n=root())
    arr = []
    return [] if n == nil || n < 0
    #root
    arr += [node[n].key]
    #left
    arr += preorder(node[n].left)
    #right
    arr += preorder(node[n].right)
    return arr
  end
  def inorder(n=root())
    arr = []
    return [] if n == nil || n < 0 
    #left
    arr += inorder(node[n].left)
    #root
    arr += [node[n].key]
    #right
    arr += inorder(node[n].right)
    return arr
  end
  def root
    #find root
    r = nil
    node.size.times {|i|
      if node[i].parent == -1 then
        r = i
        break
      end
    }
    return r
  end
  def insert(z)
    n = node.size
    node[n] = Node.new()
    node[n].key = z
    y = nil
    x = root()
    while x != nil
      y = x
      if node[n].key < node[x].key
        x = node[x].left
      else
        x = node[x].right
      end
    end
    node[n].parent = y
    if y == nil then
      node[n].parent = -1
    elsif node[n].key < node[y].key
      node[y].left = n
    else
      node[y].right = n
    end
  end
  def print
    str = inorder().join(" ")
    puts " #{str}"
    str = preorder().join(" ")
    puts " #{str}"
  end
end

class Node
  attr_accessor :key, :parent, :left, :right
  def initialize
    @key = nil
    @parent = nil
    @left = nil
    @right = nil
  end
end

n = gets.to_i
tree = BinSearchTree.new()

n.times{
  command, num = gets.split
  case command;
  when "insert"; tree.insert(num)
  when "print"; tree.print
  end
}