You are given a Binary Search Tree with elements A$-$H which are variables that have values which satisfy the BST properties.

A

B

C

What is$/$are the possible replacement of node $"$C$"$ after we delete $"$C$"?$ Select all that apply.

Alt Text for the above Tree:

The image depicts a binary tree with the following structure:

The root node is labeled $A.$

A has two children: B on the left and C on the right.

B has one right child labeled D$.$

C has two children: E on the left and F on the right.

E has one left child labeled G$.$

F has one left child labeled $H.$