Problem:
Binary Search Tree III

Write a program which performs the following operations to a binary search tree $T$ by adding delete operation to B: Binary Search Tree II.

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

find $k$: Report whether $T$ has a node containing $k$.

delete $k$: Delete a node containing $k$.

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

The operation delete $k$ for deleting a given node $z$ containing key $k$ from $T$ can be implemented by an algorithm which considers the following cases:

If $z$ has no children, we modify its parent $z.p$ to replace $z$ with NIL as its child (delete $z$).

If $z$ has only a single child, we "splice out" $z$ by making a new link between its child and its parent.

If $z$ has two children, we splice out $z$'s successor $y$ and replace $z$'s key with $y$'s key.

Input

In the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$, delete $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

18
insert 8
insert 2
insert 3
insert 7
insert 22
insert 1
find 1
find 2
find 3
find 4
find 5
find 6
find 7
find 8
print
delete 3
delete 7
print

Sample Output 1

yes
yes
yes
no
no
no
yes
yes
1 2 3 7 8 22
8 2 1 3 7 22
1 2 8 22
8 2 1 22

Reference

Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.

Solution in JAVA (judge verdict: Accepted)

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {
    static Node nodeRoot;
    static StringBuilder sb = new StringBuilder();

    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        for (int i = 0; i < n; i++) {
            String s = br.readLine();
            if (s.charAt(0) == 'i') {
                int m = Integer.parseInt(s.substring(7));
                if (nodeRoot == null) {
                    nodeRoot = new Node(m);
                    continue;
                }
                insert(m, nodeRoot);
            } else if (s.charAt(0) == 'p') {
                sb.append(" ");
                inorder(nodeRoot);
                sb.deleteCharAt(sb.length() - 1).append("\n").append(" ");
                preorder(nodeRoot);
                sb.deleteCharAt(sb.length() - 1).append("\n");
            } else if (s.charAt(0) == 'f') {
                int m = Integer.parseInt(s.substring(5));
                sb.append(find(m, nodeRoot) ? "yes\n" : "no\n");
            } else {
                int m = Integer.parseInt(s.substring(7));
                delete(m, nodeRoot);
            }
        }
        System.out.print(sb);
    }

    private static void delete(int m, Node node) {
        if (node == null) return;
        if (m > node.value) {
            if (node.right.value != m) delete(m, node.right);
            else {
                if (node.right.right == null && node.right.left == null) {
                    node.right = null;
                } else if (node.right.left == null) {
                    node.right = node.right.right;
                } else if (node.right.right == null) {
                    node.right = node.right.left;
                } else {
                    Node nd=succeed(node.right);
                    delete(nd.value, nodeRoot);
                    node.right.value = nd.value;
                }
            }
        } else if (m < node.value) {
            if (node.left.value != m) delete(m, node.left);
            else {
                if (node.left.right == null && node.left.left == null) {
                    node.left = null;
                } else if (node.left.left == null) {
                    node.left = node.left.right;
                } else if (node.left.right == null) {
                    node.left = node.left.left;
                } else {
                    Node nd=succeed(node.left);
                    delete(nd.value, nodeRoot);
                    node.left.value = nd.value;
                }
            }
        } else {
            if (node.right == null && node.left == null) {
                node = null;
            } else if (node.left == null) {
                node = node.right;
            } else if (node.right == null) {
                node = node.left;
            } else {
                Node nd=succeed(node);
                delete(nd.value, nodeRoot);
                node.value = nd.value;
            }
        }
    }

    private static Node succeed(Node node) {
        Node node1 = node.right;
        while (node1.left!=null){
            node1=node1.left;
        }
        return node1;
    }

    private static boolean find(int m, Node node) {
        if (node == null) return false;
        if (m > node.value) {
            return find(m, node.right);
        } else if (m < node.value) {
            return find(m, node.left);
        } else {
            return true;
        }
    }

    private static void preorder(Node node) {
        if (node == null) return;
        sb.append(node.value).append(" ");
        preorder(node.left);
        preorder(node.right);
    }

    private static void inorder(Node node) {
        if (node == null) return;
        inorder(node.left);
        sb.append(node.value).append(" ");
        inorder(node.right);
    }

    private static void insert(int m, Node node) {
        if (m > node.value) {
            if (node.right == null) node.right = new Node(m);
            else insert(m, node.right);
        } else {
            if (node.left == null) node.left = new Node(m);
            else insert(m, node.left);
        }
    }

    static class Node {
        int value;
        Node left;
        Node right;

        public Node(int value) {
            this.value = value;
        }
    }
}