Problem 4: (2 pts) Consider the following binary search tree. Delete the following values (in the given order): 4, 88, 15 and show the resulting binary search tree 15 23 13 30 Problem 5: (2 pts) Serialize the general tree shown below using ) as an end-of-the-child marker and preorder traversal