Which of the following traversal techniques lists the nodes of a binary search tree in ascending order?
Show answerHide answer
Correct answer: (C) Inorder
Explanation
In a BST, an inorder traversal (left, root, right) visits the keys in ascending order.