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: Wrong Answer)

import java.util.*;

class ND {
    int val; 
    ND left, right;  
    int height;

    public void reset_height () {
        this.height = Math.max(height(left), height(right)) + 1;
    }

    public static int height(ND n) {
        if (n == null) return 0;
        else return n.height;
    }

    public ND (int val, ND left,  ND right) {
        this.val = val;
        this.left = left;
        this.right = right;
        this.height = Math.max(height(left), height(right))+ 1;
    }
}

class BST {
    public static void display_AOJ1 (ND n) {
        if (n.left != null) display_AOJ1(n.left);
        System.out.printf(" %d", n.val);
        if (n.right != null) display_AOJ1(n.right);
    }
    public static void display_AOJ2 (ND n) {
        System.out.printf(" %d", n.val);
        if (n.left != null) display_AOJ2(n.left);
        if (n.right != null) display_AOJ2(n.right);
    }

    public static int min_bst(ND p) {
        if (p.left == null) return p.val;
        return min_bst(p.left);
    }

    public static boolean search_bst(ND p, int d) {
        if (p == null) return false;
        if (p.val == d) return true;
        if (d < p.val) return search_bst(p.left, d);
        else return search_bst(p.right, d);
    }

    public static ND insert_bst(ND p, int d) {
        if (p == null) return new ND(d, null, null);
        if (d < p.val) p.left = insert_bst(p.left, d);
        else p.right = insert_bst(p.right, d);
        p.reset_height();
        return p;
    }

    public static ND delete_min_bst (ND p) {
        if (p.left == null) return p.right;
        p.left = delete_min_bst(p.left);
        p.reset_height();
        return p;
    }

    public static ND delete_bst(ND p, int d) {
        if (p == null) return null;
        if (p.val == d) {
            if (p.right == null) return p.left;
            p.val = min_bst(p.right);
            p.right = delete_min_bst(p.right);
            p.reset_height();
            return p;
        }
        if (d < p.val) p.left = delete_bst(p.left, d);
        else p.right = delete_bst(p.right, d);
        p.reset_height();
        return p;
    }
}

public class Main {
    public static void main (String[] args) {
        ND root = null;
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            String cmd = sc.next();
            if (cmd.equals("insert")) {
                int val = sc.nextInt();
                root = BST.insert_bst(root, val);
            } else if (cmd.equals("find")) {
                int val = sc.nextInt();
                boolean exist = BST.search_bst(root, val);
                if (exist) {
                    System.out.println("yes");
                } else {
                    System.out.println("no");
                }
            } else if (cmd.equals("delete")) {
                int val = sc.nextInt();
                root = BST.delete_bst(root, val);
            } else {
                BST.display_AOJ1(root);
                System.out.println();
                BST.display_AOJ2(root);
                System.out.println();
            }
        }
    }
}