WBJECA 2025 — Computer PYQ

Correct Option: (A) Inorder

Explanation

A Binary Search Tree (BST) is a specialized data structure where, for any given node, all elements in the left subtree are smaller than the node, and all elements in the right subtree are greater.

• Inorder Traversal: This technique follows the pattern: Left Subtree $\to$ Root $\to$ Right Subtree. Because it always visits the smaller (left) nodes before the root and the larger (right) nodes after, it naturally retrieves data in non-decreasing (ascending) order.

  $$Inorder(Node)=Inorder(Left)+Node.value+Inorder(Right)$$

  For a valid BST, this process guarantees the sorted sequence:

  Sequence = \{x_1, x_2, x_3, ..., x_n\} \text{ where } x_1 < x_2 < ... < x_n