problem145

README

< Previous 　　　　　　　　　　　　　　　　 Next >

145. Binary Tree Postorder Traversal (Hard)

Given a binary tree, return the postorder traversal of its nodes' values.

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [3,2,1]

Follow up: Recursive solution is trivial, could you do it iteratively?

Related Topics

[Stack] [Tree]

Similar Questions

1. Binary Tree Inorder Traversal (Medium)
2. N-ary Tree Postorder Traversal (Easy)