Leetcode 145. Binary Tree Postorder Traversal
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.