Beginner
Data Structures & Algorithms
Q37 / 100
What is postorder traversal?
Correct! Well done.
Incorrect.
The correct answer is C) Visit left, right, root
C
Correct Answer
Visit left, right, root
Explanation
Postorder (left, right, root) visits children before parent. Used for deleting trees and evaluating expression trees (process operands before operator).
Progress
37/100