Total Accepted: 13099 Total Submissions: 43333
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?
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public ArrayList<Integer> postorderTraversal(TreeNode root) {
ArrayList<Integer> list = new ArrayList<Integer>();
postTraverse(root, list);
return list;
}
public void postTraverse(TreeNode root, ArrayList<Integer> list) {
if (root == null) return;
postTraverse(root.left, list);
postTraverse(root.right, list);
list.add(root.val);
}
}