Beginner Data Structures & Algorithms
Q19 / 100

What is an inorder traversal of a BST guaranteed to produce?

Correct! Well done.

Incorrect.

The correct answer is C) Elements in sorted (ascending) order

C

Correct Answer

Elements in sorted (ascending) order

Explanation

Inorder traversal (left, root, right) on a BST visits nodes in ascending value order, which is why it's used to check if a tree is a valid BST.

Previous All Questions Next
Progress
19/100
🌳

Browse All Data Structures & Algorithms Questions

100 questions · beginner to advanced