Question: Redo the binary search tree class to implement lazy deletion. Note cautiously that this affects all of the routines.
Mainly challenging are findMin and findMax, which must now be done recursively.
Your modifications are needed for the BinaryNode class and the four methods: contains, findMin, insert and remove. Pseudo code is sufficient.
Please show me all the working and provide the answer.