Which sequence represents the correct postorder traversal of a binary tree?
Options
- A. Root, Left, Right
- B. Left, Root, Right
- C. Left, Right, Root
- D. More than one of the above
- E. None of the above
Quiz Practice:
C. Left, Right, Root
Postorder traversal follows the order Left → Right → Root. Therefore, the root node is processed only after both its left and right subtrees have been processed. Postorder is useful for deleting trees because child nodes can be handled before their parent. It is also commonly used in expression trees, where operators may appear after their operands in postfix form.