Given the following sequence of operations to a binary search tree, what are the final contents of the tree? [(add, 50), (add, 9), (add, 40), (add, 7), (add, 34), (add, 1), (delete, 7), (add, 25), (add, 48), (delete, 50)] Specify your answer by separating the values by giving the contents of the tree by level, so that a full BST with 3 levels containing the numbers 1 to 7 would be listed like this: 4; 2, 6; 1, 3, 5, 7. For the delete operation, you should do the following: if the node is a leaf just remove it, else if the node only has one child then redirect its parent to its child, else replace the nodes value with the next larger value in the tree (its left-most descendent on its right)

Can you explain how to solve it please.