Available question text
Return the values of a binary tree in postorder (left → right → root). The recursive approach is trivial; the follow-up asks for an iterative solution that simulates postorder using a stack (or by modifying preorder).
Related questions
Continue with questions that share topics or the same question type.
- Construct Binary Tree from Inorder and Postorder Traversal
Coding
- Construct Binary Tree from Preorder and Postorder Traversal
Coding
- Binary Tree Inorder Traversal
Coding · Binary Tree · Depth-First Search · Stack
- Binary Tree Level Order Traversal
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 145. Binary Tree Postorder Traversal
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source