Question 51
Which traversal of a binary search tree produces keys in non-decreasing order when duplicate keys are allowed by the implementation?
Inorder visits left subtree, node, then right subtree. Under the usual BST ordering invariant, the resulting keys are sorted; duplicates may appear adjacent.