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 C (judge verdict: Time Limit Exceeded)

# define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>

typedef struct node {
	int key;
	struct node *p_left;
	struct node *p_right;
	struct node *p_parent;
}NODE;

void insert(int value);	/* ?????\ */
void inorderTreeWalk(NODE *p_node);	/* ??????????????? */
void preorderTreeWalk(NODE *p_node); /* ??????????????? */
int find(int value);	/* ??¢?´¢ */
void delete(int value);	/* ?????? */
void deleteHasNoChildNode(NODE *z);	/* ?????????????????????????????????????????? */
void deleteHasOneChildNode(NODE *z); /* ?????????????????????????????????????????? */
void deleteHasTwoChildlenNode(NODE *z);	/* ?????????????????????????????????????????? */

NODE *p_root;

int main(void) {

	char command[20];
	int value;
	int n;
	int i;
	int result_find;

	scanf("%d", &n);

	for (i = 0; i < n; i++) {
		scanf("%s", &command);
		/* insert */
		if (command[0] == 'i') {
			scanf("%d", &value);
			insert(value);
		}
		/* print */
		else if (command[0] == 'p') {
			inorderTreeWalk(p_root);
			printf("\n");
			preorderTreeWalk(p_root);
			printf("\n");
		}
		/* find */
		else if (command[0] == 'f') {
			scanf("%d", &value);
			result_find =find(value);
			if (result_find == 0) {
				printf("no\n");
			}
			else {
				printf("yes\n");
			}
		}
		/* delete */
		else if (command[0] == 'd') {
			scanf("%d", &value);
			delete(value);
		}
	}
	return 0;
}

void insert(int value) {
	NODE *x = p_root;	/* ??? */
	NODE *y = NULL;	/* x?????? */

	NODE *z = (NODE *)malloc(sizeof(NODE));
	z->key = value;
	z->p_left = NULL;
	z->p_right = NULL;

	while (x != NULL) {
		y = x;
		if (z->key < x->key) {
			x = x->p_left;		/* ?????????????§???? */
		}
		else {
			x = x->p_right;	/* ?????????????§???? */
		}
	}
	z->p_parent = y;

	if (y == NULL) {	/* ??¨???????????´??? */
		p_root = z;
	}
	else if (z->key < y->key) {
		y->p_left = z;	//z?????????????????????
	}
	else {
		y->p_right = z;	//z?????????????????????
	}
}

//?????????????????§??¨???
void inorderTreeWalk(NODE *p_node) {

	if (p_node == NULL) {
		return;
	}
	inorderTreeWalk(p_node->p_left);
	printf(" %d", p_node->key);
	inorderTreeWalk(p_node->p_right);
}

//?????????????????§??¨???
void preorderTreeWalk(NODE *p_node) {

	if (p_node == NULL) {
		return;
	}
	printf(" %d", p_node->key);
	preorderTreeWalk(p_node->p_left);
	preorderTreeWalk(p_node->p_right);
}

/* ??????????????????value????????¨????????????????????±????????? */
/* ????????????0 : ?????¨?????????, 1 : ?????¨?????? */
int find(int value) {
	
	NODE *p_node;
	p_node = p_root;

	while (1) {
		if (p_node->key > value) {
			if (p_node->p_left != NULL) {
				p_node = p_node->p_left; /* ?????????????§???? */
			}
			else {
				return 0;
			}
		}
		else if (p_node->key < value) {
			if (p_node->p_right != NULL) {
				p_node = p_node->p_right; /* ?????????????§???? */
			}
			else {
				return 0;
			}
		}
		else {
			return 1;
		}
	}
}

void delete(int value) {
	NODE *z;
	z = p_root;

	/* ?????????????????????????????¢??? */
	while (1) {
		if (z->key > value) {
			z = z->p_left; /* ?????????????§???? */
		}
		else if (z->key < value) {
			z = z->p_right; /* ?????????????§???? */
		}
		else {
			break;
		}
	}

	/* ??????????±????????????????????????????????????¨??? */
	if (z->p_left == NULL && z->p_right == NULL) {
		deleteHasNoChildNode(z);
	}
	/* ??????????±??????????????????????????????????????????¨??? */
	else if (z->p_right == NULL || z->p_left == NULL) {
		
		deleteHasOneChildNode(z);
	}
	/* ??????????±????????????????????????????????????¨??? */
	else {
		deleteHasTwoChildlenNode(z);
	}
}

/* ?????????????????????????????????????????? */
void deleteHasNoChildNode(NODE *z) {

	if (z->key > z->p_parent->key) {
		z->p_parent->p_right = NULL;
	}
	else {
		z->p_parent->p_left = NULL;
	}
	free(z);
}

/* ?????????????????????????????????????????? */
void deleteHasOneChildNode(NODE *z) {

	if (z->p_left != NULL && z->p_right == NULL) {
		if (z->key > z->p_parent->key) {
			z->p_parent->p_right = z->p_left;
		}
		else {
			z->p_parent->p_left = z->p_left;
		}
		z->p_left->p_parent = z->p_parent;
	}

	else{
		if (z->key > z->p_parent->key) {
			z->p_parent->p_right = z->p_right;
		}
		else {
			z->p_parent->p_left = z->p_right;
		}
		z->p_right->p_parent = z->p_parent;
	}
	free(z);
}

/* ?????????????????????????????????????????? */
void deleteHasTwoChildlenNode(NODE *z) {

	NODE *y; /* z????¬??????? */

	if (z->p_right == NULL) {
		y = z->p_parent;
	}
	else {
		y = z->p_right;
	}
	/* y????????????z????????????????????? */
	z->key = y->key;

	/* y????????? */
	if (y->p_left == NULL && y->p_right == NULL) {
		deleteHasNoChildNode(y);
	}
	else if (y->p_left != NULL && y->p_right == NULL ||
			y->p_left == NULL && y->p_right != NULL) {
		
		deleteHasOneChildNode(y);
	}
}