Which of the following traversal techniques lists the nodes of a binary search…
2026
Which of the following traversal techniques lists the nodes of a binary search tree in ascending order?
- A.
Post-order
- B.
Pre-order
- C.
In-order
- D.
None of the above
Attempted by 341 students.
Show answer & explanation
Correct answer: C
In a Binary Search Tree (BST), an in-order traversal visits nodes by processing the left subtree, then the root node, and finally the right subtree. Because of the BST property (left < root < right), this sequence results in nodes being listed in ascending order.