← Quiz: Tree Traversals: all 13 questions
Quiz: Tree Traversals · Question 2 of 13
Which traversal of a binary search tree gives the values in sorted order?
Which traversal of a binary search tree gives the values in sorted order?
- A.Preorder
- B.Inorder
- C.Postorder
- D.Level order
Answer & explanation
Correct answer: Inorder
In a BST everything left is smaller and everything right is larger, so left–root–right is ascending.
Can you get the rest right without peeking?
Take the timed Quiz: Tree Traversals quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →