题解 | 二叉树的后序遍历

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 * }
 */

public class Solution {
    /**
     * 
     * @param root TreeNode类 
     * @return int整型ArrayList
     */
    public ArrayList<Integer> postorderTraversal (TreeNode root) {
        // write code here
        ArrayList<Integer> result=new ArrayList();

        postorderHelper(root,result);

        return result;
    }

    private void postorderHelper(TreeNode node,ArrayList<Integer> result){
        if(null==node){
            return;
        }

        postorderHelper(node.left,result);
        postorderHelper(node.right,result);

        result.add(node.val);

    }
}