Carrying out these experiments will help to provide insights into the topics covered in the chapter. No programming is involved.
Create a UML activity diagram (or flowchart, for you old-timers) of the various possibilities when deleting a node from a binary search tree. It should detail the three cases described in the text. Include the variations for left and right children and special cases like deletion of the root. For example, there are two possibilities for case 1 (left and right children). Boxes at the end of each path should describe how to do the deletion in that situation.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.