Algorithms and Data Structures · Middle · Question 36 of 75
Which tree traversal visits the values of a BST in sorted order?
- ✓Correct answer: In-order (left, node, right)
- 2Pre-order (node, left, right)
- 3Level order (by depth)
Explanation
In-order visits everything smaller than a node before it and everything larger after it. Pre-order is handy for copying a tree, post-order for deleting it or evaluating expressions.