When deleting a node with two children from a binary search tree, we chose to replace it with its inorder successor. What other value would be an equally reasonable choice? Explain.
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.