Which traversal of a binary search tree gives elements in sorted order?
2026
Which traversal of a binary search tree gives elements in sorted order?
Answer: C. Inorder — The correct answer is Inorder traversal. This traversal visits the left subtree, then the root, and finally the right subtree, resulting in elements being…
- A.
Preorder
- B.
Postorder
- C.
Inorder
- D.
Level order
Attempted by 634 students.
Show answer & explanation
Correct answer: C
The correct answer is Inorder traversal. This traversal visits the left subtree, then the root, and finally the right subtree, resulting in elements being visited in ascending sorted order for a Binary Search Tree.
Loading lesson…