You wish to traverse a binary search tree in sorted order. Which of the following schemes will accomplish this?
I inorder traversal
II preorder traversal
III postorder traversal
A) I
B) II
C) III
D) II and III

Question

Quizplus · Accepted Answer

Inorder traversal visits nodes in the left subtree, then the root, and finally the right subtree, which results in nodes being visited in ascending order for a binary search tree.

You Wish to Traverse a Binary Search Tree in Sorted