Removing an Item from a Binary Search Tree in the case number three, node has a left child and a right child, there are$$ two options:

$1)$ replace the node$$s value with the largest value in the left subtree and delete that value$$s node from the left subtree.

Or $2)$ replace the node$$s value with the smallest value in the right subtree and delete that value$$s node from the right subtree.

In the following BST$,$ what are the two possible values for deleting the root value, $50?$

Group of answer choices

$1276$

$1772$

$2354$