Consider the Operation of Deleting the Root of a Binary

Multiple Choice

Consider the operation of deleting the root of a binary search tree.If the root has one child,then

A) the root of the subtree should be recursively deleted
B) the element stored in the root node should be replaced with null
C) the reference to the root of the tree should be set to point to the one child
D) the operation should be recursively performed on the one subtree of the root