[LintCode]Binary Tree Postorder Traversal
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/**
* @param root: The root of binary tree.
* @return: Postorder in ArrayList which contains node values.
*/
public ArrayList<Integer> postorderTraversal(TreeNode root) {
// 2015-3-22
ArrayList<Integer> rst = new ArrayList<>();
if (root == null) {
return rst;
}
// divide
ArrayList<Integer> left = postorderTraversal(root.left);
ArrayList<Integer> right = postorderTraversal(root.right);
// conquer
rst.addAll(left);
rst.addAll(right);
rst.add(root.val);
return rst;
}
}