In a Binary Search Tree (BST), the operation of deleting a node with one child…
2025
In a Binary Search Tree (BST), the operation of deleting a node with one child involves:
- A.
Removing the node and replacing it with its only child (left or right)
- B.
Removing the node and replacing it only with its left child
- C.
Removing the node and replacing it with its parent
- D.
Removing the node without reconnecting its child
Attempted by 219 students.
Show answer & explanation
Correct answer: A
Answer: Removing the node and replacing it with its only child.
Reason: In a Binary Search Tree, deletion depends on the number of children of the deleted node.
If the node has no child, simply remove it.
If the node has one child, connect that child directly to the deleted node's parent.
This preserves the BST ordering because all values in the child subtree already belong on the same side of the parent link.
Final answer: Option A is correct.