Question

In the following binary search tree, show the resulting binary search tree after deleting Key 25, then key 9.

						15
			9						25
	5				13						30
2		6		10		14
					11

(15, 9, 25, 5, 13, 30, 2, 6, 10, 14, 11)

BST after deleting key 25:

BST after deleting key 9:

Answer 1

Answer:

here is the tree after deleting 25:

Because the node has only one child, so we can simply replace the node with its child and delete it.

						15
			9						30
	5				13
2		6		10		14
					11

Now to delete 9, we have to replace it with its inorder successor which is 10.

So, replacing 9 with 10 forms this:

						15
			10						30
	5				13
2		6				14
					11

Hope you like it!

Please upvote and provide comments if you have any doubts!