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 Rust (judge verdict: Accepted)

use std::fmt::Write;
use Node::{Nil, Cons};
use std::fmt::Display;
use std::cell::RefCell;
use std::rc::Rc;

fn main() {
    let mut bst: BST<i32>  = BST::new();
    let n: i32 = read();
    for _ in 0..n {
        let vec: Vec<String> = read_as_vec();
        let cmd: &str = &vec[0];
        if cmd == "insert" {
            let key: i32 = vec[1].parse().ok().unwrap();
            bst.insert(key);
        } else if cmd == "find" {
            let key: i32 = vec[1].parse().ok().unwrap();
            if bst.find(key) {
                println!("yes");
            } else {
                println!("no");
            }
        } else if cmd == "delete" {
            let key: i32 = vec[1].parse().ok().unwrap();
            bst.delete(key);
        } else if cmd == "print" {
            println!(" {}", bst.inorder());
            println!(" {}", bst.preorder());
        }

    }
}

#[derive(Ord, PartialOrd, Eq, PartialEq, Debug)]
enum Node<T: Ord + PartialOrd + Eq + PartialEq  + Display> {
    Nil,
    Cons(
        Rc<RefCell<T>>,
        Rc<RefCell<Node<T>>>,
        Rc<RefCell<Node<T>>>,
        ),
}

struct BST<T: Ord + PartialOrd + Eq + PartialEq + Display> {
    root: Rc<RefCell<Node<T>>>
}

impl<T: Ord + PartialOrd + Eq + PartialEq + Display> BST<T> {
    fn new() -> BST<T> {
        BST { root: Rc::new(RefCell::new(Nil)) }
    }

    fn find(&mut self, target: T) -> bool {
        Node::find(Rc::clone(& self.root), target).is_some()
    }

    fn insert(&mut self, value: T) {
        Node::insert(Rc::clone(& self.root), value);
    }

    fn delete(&mut self, target: T) {
        if let Some((ptr, node)) = Node::find_for_delete(&mut self.root, Rc::clone(& self.root), target) {
            Node::delete(ptr, node);
        }
    }

    fn preorder(&self) -> String {
        let mut buf: String = String::new();
        Node::preorder(Rc::clone(& self.root), &mut buf);
        buf.pop();
        buf
    }

    fn inorder(&self) -> String {
        let mut buf: String = String::new();
        Node::inorder(Rc::clone(& self.root), &mut buf);
        buf.pop();
        buf
    }
}

impl<T: Ord + PartialOrd + Eq + PartialEq + Display> Node<T> {
    fn insert(node: Rc<RefCell<Node<T>>>, value: T) {
        match *node.borrow_mut() {
            Cons(ref v, ref l, ref r) => {
                if value < *v.borrow() {
                    Self::insert(Rc::clone(l), value);
                } else if value > *v.borrow() {
                    Self::insert(Rc::clone(r), value);
                }
            }, ref mut nil => { *nil = Cons(
                    Rc::new(RefCell::new(value)),
                    Rc::new(RefCell::new(Nil)),
                    Rc::new(RefCell::new(Nil)),
                    );
            }
        }
    }

    fn find(node: Rc<RefCell<Node<T>>>, target: T) -> Option<Rc<RefCell<Node<T>>>> {
        if let Cons(ref v, ref l, ref r) = *node.borrow() {
            if target < *v.borrow() {
                Self::find(Rc::clone(l), target)
            } else if target > *v.borrow() {
                Self::find(Rc::clone(r), target)
            } else {
                Some(Rc::clone(& node))
            }
        } else {
            None
        }
    }

    fn find_for_delete(ptr: *mut Rc<RefCell<Node<T>>>, node: Rc<RefCell<Node<T>>>, target: T) ->
        Option<(*mut Rc<RefCell<Node<T>>>, Rc<RefCell<Node<T>>>)> {
        if let Cons(ref v, ref mut l, ref mut r) = *node.borrow_mut() {
            if target < *v.borrow() {
                Self::find_for_delete(l, Rc::clone(l), target)
            } else if target > *v.borrow() {
                Self::find_for_delete(r, Rc::clone(r), target)
            } else {
                Some((ptr, Rc::clone(& node)))
            }
        } else {
            None
        }
    }

    fn find_next_node(ptr: *mut Rc<RefCell<Node<T>>>, node: Rc<RefCell<Node<T>>>) ->
        Option<(*mut Rc<RefCell<Node<T>>>, Rc<RefCell<Node<T>>>)> {
        if let Cons(_, ref mut l, _) = *node.borrow_mut() {
            if *l.borrow() == Nil {
                Some((ptr, Rc::clone(& node)))
            } else {
                Self::find_next_node(l, Rc::clone(l))
            }
        } else {
            None
        }
    }

    fn delete(ptr: *mut Rc<RefCell<Node<T>>>, node: Rc<RefCell<Node<T>>>) {
        let replace: Option<Rc<RefCell<Node<T>>>> = match *node.borrow() {
            Cons(_, ref l, ref r) => {
                if *l.borrow() == Nil && *r.borrow() == Nil {
                    Some(Rc::new(RefCell::new(Nil)))
                } else if *l.borrow() == Nil {
                    Some(Rc::clone(r))
                } else if *r.borrow() == Nil {
                    Some(Rc::clone(l))
                } else {
                    None
                }
            },
            Nil => None, // unreachable
        };
        if let Some(replace) = replace {
            unsafe {
                *ptr = replace;
            }
        } else {
            if let Cons(ref mut v, _, ref mut r) = *node.borrow_mut() {
                let (next_ptr, next_node) = Self::find_next_node(r, Rc::clone(r)).unwrap();
                if let Cons(ref cv, ..) = *next_node.borrow() {
                    *v = Rc::clone(cv);
                }
                Node::delete(next_ptr, next_node);
            }
        }
    }

    fn preorder(node: Rc<RefCell<Node<T>>>, buf: &mut String) {
        if let Cons(ref v, ref l, ref r) = *node.borrow() {
            write!(buf, "{} ", *v.borrow()).unwrap();
            Self::preorder(Rc::clone(l), buf);
            Self::preorder(Rc::clone(r), buf);
        }
    }

    fn inorder(node: Rc<RefCell<Node<T>>>, buf: &mut String) {
        if let Cons(ref v, ref l, ref r) = *node.borrow() {
            Self::inorder(Rc::clone(l), buf);
            write!(buf, "{} ", *v.borrow()).unwrap();
            Self::inorder(Rc::clone(r), buf);
        }
    }

}

fn read<T: std::str::FromStr>() -> T {
    let mut input = String::new();
    std::io::stdin().read_line(&mut input).unwrap();
    input.trim().parse::<T>().ok().unwrap()
}

fn read_as_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse::<T>().ok().unwrap())
        .collect()
}