2. The following diagram shows a height-balanced binary search tree. Perform the following operations successively: insert 24, insert 19, and delete 50. If you have to delete a node with two children, replace the node with its immediate successor. Perform rotation(s) to keep the binary search tree height-balanced after each operation. 50 15 62 20 58 91 37 60