DeleteApp

package prep_33_binarysearchtrees;

public class DeleteApp {
	public static void main(String[] args) {
		BST_delete tree = new BST_delete();

		/* Let us create following BST
        50
     /     \
    30      70
   /  \    /  \
  20   40  60   80 */

		tree.insert(50);
		tree.insert(30);
		tree.insert(20);
		tree.insert(40);
		tree.insert(70);
		tree.insert(60);
		tree.insert(80);

		System.out.println("Inorder traversal of the given tree");
		tree.inorder();

		System.out.println("\nDelete 20");
		tree.deleteKey(20);

		System.out.println("Inorder traversal of the modified tree");
		tree.inorder();

		System.out.println("\nDelete 30");
		tree.deleteKey(30);

		System.out.println("Inorder traversal of the modified tree");
		tree.inorder();

		System.out.println("\nDelete 50");
		tree.deleteKey(50);

		System.out.println("Inorder traversal of the modified tree");
		tree.inorder();
	}
}