Beginner
Data Structures & Algorithms
Q9 / 100
Which traversal visits root, left subtree, right subtree in that order?
Correct! Well done.
Incorrect.
The correct answer is D) Preorder
D
Correct Answer
Preorder
Explanation
Preorder traversal visits the current node first, then recursively visits left and right subtrees. Useful for copying or serializing a tree.
Progress
9/100