LearnFrenzy
Sign in Take a free test

Data Structures in Java · Data Structures in Java MCQ · Question 8

Traversal that lists BST keys in sorted order Answer, explanation & discussion

  • MCQ
  • Easy
  • 0 comments
  • Answer explained
  • Moderated community
Question 8 Back to Exercise

Which traversal of a binary search tree visits its keys in ascending order?

  • A Preorder
  • B Inorder Correct
  • C Postorder
  • D Level-order
Correct Answer: Option B

Inorder visits the left subtree (smaller keys), then the node, then the right subtree (larger keys).

Discussion & Comments 0

Share your method, a shortcut, or ask about a step you didn't follow.

No comments yet. Be the first to share your solution!

Post your comment

Comments appear after a quick review by our team.

Search LearnFrenzy

Esc

Quick links