To delete a node in a given binary search tree, there are three cases: 1. The node does not have any children 2. The node has only one child 3. The node has two children Please describe the steps of...

Please answer the question in the screenshot. Please give reasoning.

Extracted text: To delete a node in a given binary search tree, there are three cases: 1. The node does not have any children 2. The node has only one child 3. The node has two children Please describe the steps of deleting the node only for case (3) briefly. No code is in need to answer this question.