Question: Write a program to evaluate empirically the following strategies for removing nodes with two children. Recall that a strategy involves replacing the value in a deleted node with some other value. Which strategy gives the best balance? Which takes the least CPU time to process an entire sequence of operations?
a. Replace with the value in the largest node, X, in TL and recursively remove X.
b. Alternatively replace with the value in the largest node in TL or the value in the smallest node in TR and recursively remove the appropriate node.
c. Replace with the value in the largest node in TL or the value in the smallest node in TR (recursively remove the appropriate node), making the choice randomly.