A reader sent us the following query:
When we deleting the parent node wiht two children, could we 1. Starting by traversing the left subtree of the soon-to-be delted parent node in such a way that you reach the right-most value - the value that will appear to be the biggest value in the whole subtree. 2. Replace the value of the node, found in the last step, with the parent’s node value. 3. Finally, delete the leaf node.