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.util.Scanner;
import java.util.stream.IntStream;

public class Main {
    static Node root;

    public static void main(String[] args) {
        new Main().run();
    }

    public void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        IntStream.range(0, N).forEach(i -> {
            String cmd = sc.next();
            if (cmd.equals("insert")) {
                int id = sc.nextInt();
                insert(new Node(id));
            } else if(cmd.equals("find")) {
                int id = sc.nextInt();
                System.out.println(find(root, id) != null ? "yes": "no");
            } else if(cmd.equals("delete")) {
                int id = sc.nextInt();
                delete(find(root, id));
            } else if(cmd.equals("print")) {
                print();
            }
        });
    }


    class Node {
        int id;
        Node parent = null, left = null, right = null;

        Node(int id) {
            this.id = id;
        }
    }

    private void delete(Node node) {
        Node del;
        Node delChild;

        //case1,2 or case3
        if (node.left == null || node.right == null) {
            del = node;
        } else {
            del = getSuccessor(node);
        }

        if (del.left != null) {
            delChild = del.left;
        } else {
            delChild = del.right;
        }

        if (delChild != null) {
            delChild.parent = del.parent;
        }

        if (del.parent == null) {
            root = delChild;
        } else {
            if (del == del.parent.left) {
                del.parent.left = delChild;
            } else {
                del.parent.right = delChild;
            }
        }

        //for case3
        if (del != node) {
            node.id = del.id;
        }
    }

    private Node getSuccessor(Node node) {
        if(node.right != null) return treeMinimum(node.right);
        Node s = node.parent;
        while (s != null && s.right == node) {
            node = s;
            s = s.parent;
        }
        return s;
    }

    private Node treeMinimum(Node node) {
        while(node.left != null) {
            node = node.left;
        }
        return node;
    }

    private Node find(Node node, int id) {
        while(node != null && id != node.id) {
            if(id < node.id) {
                node = node.left;
            } else {
                node = node.right;
            }
        }
        return node;
    }

    private void insert(Node node) {
        Node parent = null;
        Node position = root;

        while(position != null) {
            parent = position;
            if(node.id < position.id) {
                position = position.left;
            } else {
                position = position.right;
            }
        }

        node.parent = parent;

        if (parent == null) {
            root = node;
        } else {
           if(node.id < parent.id) {
               parent.left = node;
           } else {
               parent.right = node;
           }
        }
    }

    private void print() {
        inOrder(root);
        System.out.println();
        preOrder(root);
        System.out.println();
    }

    private void preOrder(Node node) {
        if(node == null) {
            return;
        }
        System.out.print(" "  + node.id);
        preOrder(node.left);
        preOrder(node.right);
    }

    private void inOrder(Node node) {
        if(node == null) {
            return;
        }
        inOrder(node.left);
        System.out.print(" " + node.id);
        inOrder(node.right);
    }
}