What will be the INORDER TRAVERSAL sequence of a Binary Search Tree whose POST…

2026

What will be the INORDER TRAVERSAL sequence of a Binary Search Tree whose POST ORDER TRAVERSAL sequence is 5, 4, 9, 11, 12, 10, 13, 6 ?

  1. A.

    4, 5, 9, 6, 11, 12, 10, 13

  2. B.

    13, 12, 11, 10, 9, 6, 5, 4

  3. C.

    4, 5, 6, 9, 10, 11, 12, 13

  4. D.

    6, 5, 4, 9, 13, 12, 11, 10

Attempted by 134 students.

Show answer & explanation

Correct answer: C

In a BST, Inorder Traversal is always sorted. Sorting the Post Order elements [5, 4, 9, 11, 12, 10, 13, 6] yields [4, 5, 6, 9, 10, 11, 12, 13].

Explore the full course: Niacl Ao It Specialist