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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class Main {
    public static void main (String[] args) throws IOException {
	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	Node root = new Node();
	TreeWalker walker = new TreeWalker();
	int n = Integer.parseInt(br.readLine());
	String[] input;
	for (int i = 0; i < n; i++) {
	    input = br.readLine().split(" ");
	    if (input.length == 1) {
		walker.runPrintInorder(root.right);
		walker.runPrintPreorder(root.right);
	    } else if (input.length == 2) {
		if (input[0].equals("insert")) {
		    root.insert (root, Integer.parseInt(input[1]));
		} else if (input[0].equals("find")) {
		    root.find (root, Integer.parseInt(input[1]));
		} else if (input[0].equals("delete")) {
		    root.delete (root, Integer.parseInt(input[1]));
		}
	    }
	}
	
    }
}
class Node {
    int key;
    Node left;
    Node right;
    TreeWalker walker = new TreeWalker();
    ArrayList<Node> list;
    Node () {
	key = 2000000001 * (-1);
	left = null;
	right = null;
    }
    Node (int key) {
	this.key = key;
	left = null;
	right = null;
    }
    void insert (Node root, int key) {
	Node node = root;
	Node parent = null;
	while (node != null) {
	    parent = node;
	    if (key < node.key) {
		node = node.left;
	    } else {
		node = node.right;
	    }
	}
	if (parent == null) {
	    parent = new Node (key);
	} else if (key < parent.key) {
	    parent.left = new Node (key);
	} else {
	    parent.right = new Node (key);
	}
    }
    void find (Node root, int key) {
	Node node = root;
	boolean isFind = false;
	while (node != null) {
	    if (key == node.key) {
		isFind = true;
		break;
	    }
	    if (key < node.key) {
		node = node.left;
	    } else {
		node = node.right;
	    }
	}
	if (isFind) {
	    System.out.println("yes");
	} else {
	    System.out.println("no");
	}
    }
    void delete (Node root, int key) {
	Node node = root;
	Node parent = null;
	while (node != null && node.key != key) {
	    parent = node;
	    if (key < node.key) {
		node = node.left;
	    } else {
		node = node.right;
	    }
	}
	if (node.left == null && node.right == null) {
	    deleteLeaf(parent, node);
	} else if (node.left != null || node.right != null) {
	    deleteInternalNode(parent, node);
	} else if (node.left != null && node.right != null) {
	    list = walker.getInorder(root);
	    int index = 0;
	    while (list.get(index) != node) {
		index++;
	    }
	    Node nextNode = list.get(index+1);
	    key = nextNode.key;
	    node = root;
	    parent = null;
	    while (node != null && node.key != key) {
		parent = node;
		if (key < node.key) {
		    node = node.left;
		} else {
		    node = node.right;
		}
	    }
	    node.key = nextNode.key;
	    if (nextNode.left == null && nextNode.right == null) {
		deleteLeaf(parent, nextNode);
	    } else if (nextNode.left != null || nextNode.right != null) {
		deleteInternalNode(parent, nextNode);
	    }
	}
    }
    void deleteLeaf (Node parent, Node child) {
	if (parent.left == child) {
	    parent.left = null;
	} else if (parent.right == child) {
	    parent.right = null;
	}
	child = null;
    }
    void deleteInternalNode (Node parent, Node node) {
	if (node.left != null && node.right == null) {
	    if (parent.left == node) {
		parent.left = node.left;
	    } else if (parent.right == node) {
		parent.right = node.left;		
	    }
	} else if (node.left == null && node.right != null) {
	    if (parent.left == node) {
		parent.left = node.right;
	    } else if (parent.right == node) {
		parent.right = node.right;
	    }
	}
	node = null;
    }
}
class TreeWalker {
    ArrayList<Node> getInorder (Node root) {
	ArrayList<Node> list = new ArrayList<Node>();
	inorder(root, list);
	return list;
    }
    void inorder (Node node, ArrayList<Node> list) {
	if (node == null) {
	    return;
	}
	inorder(node.left, list);
	list.add(node);
	inorder(node.right, list);
    }
    void runPrintInorder (Node root) {
	StringBuilder sb = new StringBuilder();
	printInorder(root, sb);
	System.out.println(sb);
    }
    void printInorder (Node node, StringBuilder sb) {
	if (node == null) {
	    return;
	}
	printInorder(node.left, sb);
	sb.append(" " + node.key);
	printInorder(node.right, sb);
    }
    void runPrintPreorder (Node root) {
	StringBuilder sb = new StringBuilder();
	printPreorder(root, sb);
	System.out.println(sb);
    }
    void printPreorder (Node node, StringBuilder sb) {
	if (node == null) {
	    return;
	}
	sb.append(" " + node.key);
	printPreorder(node.left, sb);
	printPreorder(node.right, sb);
    }
}