4. Draw the binary min-heap after inserting the following values, one after another.
21, 13, 12, 25, 4, 20, 16, 1, 11.
You must show that insertion step by step. Delete a root node from the heap using down
heap Bubbling.
5. The following diagram shows a binary search tree. Perform the following operations:
insert 24, insert 19, and delete 50. Use the inorder successor to perform node deletion.
Draw the new BST after every operation.