Which of the following traversal techniques lists the nodes of a binary search…
2018
Which of the following traversal techniques lists the nodes of a binary search tree in ascending order?
- A.
Postorder
- B.
Preorder
- C.
Inorder
- D.
None of the above
Attempted by 269 students.
Show answer & explanation
Correct answer: C
In a Binary Search Tree (BST), the left subtree contains values smaller than the root, and the right subtree contains values larger than the root.
Inorder traversal follows the sequence: Left Subtree -> Root Node -> Right Subtree.
By visiting the left subtree first, then the root, and finally the right subtree, inorder traversal naturally outputs nodes in ascending order for any valid BST.