If node 16 is deleted from the following binary tree and the resulting binary tree is traversed in-order then what would be the sequence in which the nodes would be visited?

The correct answer is : option 1

Key Points

In-order Traversal:

In-order traversal of a binary tree means: Left Subtree → Root → Right Subtree

Original Tree (Before deletion of node 16):

        22
       /  \
     10    44
       \
        16
          \
           19

In-order traversal before deletion: 10 → 16 → 19 → 22 → 44

Now delete node 16:
Since node 16 has only one child (19), deletion involves linking node 10 directly to node 19.

Modified Tree (After deletion of node 16):

        22
       /  \
     10    44
       \
        19

In-order traversal after deletion:

• Left subtree of 22: Traverse 10 → 19
• Visit root: 22
• Right subtree of 22: 44

Sequence: 10, 19, 22, 44

Correct Option: Option 1) 10, 19, 22, 44

Additional Information

• In-order traversal always visits the left subtree, then the root, then the right subtree.
• When a node with only one child is deleted, its child is directly connected to its parent.
• The resulting structure still maintains the binary search tree (BST) property.