Consider the Following Binary Search Tree Diagram: If Node

Multiple Choice

Consider the following binary search tree diagram: If node M is to be removed, which action should be taken?

A) Replace M with the smallest value in its left subtree.
B) Replace M with the smallest value in its right subtree.
C) Replace M with the largest value in its left subtree.
D) Replace M with the largest value in its right subtree.