Given a binary tree, return the postorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3}
,
1 \ 2 / 3
return [3,2,1]
.
Note: Recursive solution is trivial, could you do it iteratively?
Subscribe to see which companies asked this question
public class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> list =new ArrayList<Integer>();
if(root!=null)
postOrder(root,list);
return list;
}
public void postOrder(TreeNode root,List<Integer> list){
if(root.left!=null){
postOrder(root.left, list);
}
if(root.right!=null){
postOrder(root.right, list);
}
list.add(root.val);
}
}