In a Binary Search Tree (BST), the operation of deleting a node with one child…

Bihar STET · PGT (Paper 2) · Computer Science · 2025

1. A.

   Removing the node and replacing it with its only child (left or right)

2. B.

   Removing the node and replacing it only with its left child

3. C.

   Removing the node and replacing it with its parent

4. D.

   Removing the node without reconnecting its child

Attempted by 622 students.

The worked solution is available to enrolled students.