Leetcode-binary-tree-postorder-traversal

题目描述

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?

后序遍历，和之前总结的先序遍历、中序遍历相同，直接上代码：

 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.*;
public class Solution {
    public ArrayList<Integer> postorderTraversal(TreeNode root) {
        ArrayList<Integer> list = new ArrayList<Integer>();

        list = postorder(root,list);
        return list;
        
    }
    public ArrayList<Integer> postorder(TreeNode root, ArrayList<Integer> list){
        if(root != null){   //这个判断条件至关重要，也是递归终止条件，即根节点是空
        	postorder(root.left, list);
        	postorder(root.right, list);
        	list.add(root.val);
        }
        
        return list;
    }
}