← Binary Trees & BST Quiz: all 8 questions
Binary Trees & BST Quiz · Question 4 of 8
Which traversal of a Binary Search Tree visits values in sorted order?
Which traversal of a Binary Search Tree visits values in sorted order?
- A.Preorder
- B.Inorder
- C.Postorder
- D.Level order
Answer & explanation
Correct answer: Inorder
In a BST, left < node < right, so left-node-right yields ascending order.
Can you get the rest right without peeking?
Take the timed Binary Trees & BST Quiz quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →