Question

Which tree traversal visits left subtree, root, then right subtree?

• A. Preorder
• B. Inorder
• C. Postorder
• D. Level order

Hint:

In a Binary Search Tree (BST), an Inorder traversal will always visit the nodes in ascending (sorted) order. This is a very useful property for validating or searching BSTs.

Answer 1

The Correct Option is B

Concept: Tree traversal refers to the process of visiting all nodes in a tree data structure in a specific sequence.
• Depth-First Search (DFS): Includes Preorder, Inorder, and Postorder.
• Breadth-First Search (BFS): Known as Level Order traversal.

Step 1: Analyzing the Preorder sequence.
Preorder visits the Root first, then Left, then Right (Root-L-R).

Step 2: Analyzing the Inorder sequence.
Inorder visits the Left subtree, then the Root, then the Right subtree (L-Root-R). This is the exact sequence described in the problem statement.

Step 3: Analyzing the Postorder sequence.
Postorder visits the Left subtree, then Right subtree, and finally the Root (L-R-Root).