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;
 
public class Main {
    static Node node;
    static Node root;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        String str;
        int n = sc.nextInt();
        for (int i = 0; i < n; i++) {
            str = sc.next();
            if (str.equals("print")) {
                inorder(root);
                System.out.println();
                preorder(root);
                System.out.println();
            } else if (str.equals("insert")) {
                Node z = new Node();
                z.key = sc.nextInt();
                insert(z);
            } else if (str.equals("find")) {
                int k = sc.nextInt();
                find(k);
                System.out.println();
            } else if (str.equals("delete")) {
 
                Node z = new Node();
                z.key = sc.nextInt();
                delete(z);
            }
 
        }
    }
    static void inorder(Node node) {
        if (node == null) return;
        inorder(node.left);
        System.out.print(" " + node.key);
        inorder(node.right);
    }
 
    static void preorder(Node node) {
        if (node == null) return;
        System.out.print(" " + node.key);
        preorder(node.left);
        preorder(node.right);
    }
 
    static void insert(Node z) {
        if (root == null) {
            root = z;
            return;
        }
        Node y = null;
        Node x = root;
        while (x != null) {
            y = x;
            if (z.key < x.key) x = x.left;
            else x = x.right;
        }
 
        if (z.key < y.key) y.left = z;
        else y.right = z;
    }
 
    static void find(int k) {
        node = root;
        while (true) {
            if (node.key > k) {
                if (node.left == null) {
                    System.out.print("no");
                    return;
                } else {
                    node = node.left;
                }
            } else if (node.key < k) {
                if (node.right == null) {
                    System.out.print("no");
                    return;
                } else {
                    node = node.right;
                }
            } else if (node.key == k) {
                System.out.print("yes");
                return;
            }
        }
    }
 
    static void delete(Node z) {
        Node p = null;
        node = root;
        while (z.key != node.key) {
            p = node;
            if (node.key > z.key) node = node.left;
            else if (node.key < z.key) node = node.right;
        }
        if (node.left == null && node.right == null) {
            if (p.key < node.key) p.right = null;
            else p.left = null;
        } else if (node.left == null) {
            if (p.key < node.key) p.right = node.right;
            else p.left = node.right;
        } else if (node.right == null) {
            if (p.key < node.key) p.right = node.left;
            else p.left = node.left;
        } else {
            Node node2 = node;
            p = node;
            node = node.right;
            while(node.left!=null){
                p = node;
                node = node.left;
            }
            //System.out.println(node.key + " " + node2.key+" "+p.key);
            node2.key = node.key;
             
            if (node.left == null && node.right == null) {
                //System.out.println(node.key + " " + node2.key+" "+p.key);
                if (p.key <= node.key) p.right = null;
                else p.left = null;
            } else if (node.left == null) {
                if (p.key < node.key) p.right = node.right;
                else p.left = node.right;
            } else if (node.right == null) {
                if (p.key < node.key) p.right = node.left;
                else p.left = node.left;
            }
        }
    }
}
 
class Node {
    int key;
    Node left;
    Node right;
    Node() {
        key = -1;
        left = null;
        right = null;
    }
}