题解 | #二叉树的后序遍历#

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @return int整型一维数组
     */
    public int[] postorderTraversal (TreeNode root) {
        ArrayList<Integer> arr=new ArrayList<>();
        postorder(root,arr);

        int[] num=new int[arr.size()];
        for(int i=0;i<arr.size();i++){
            num[i]=arr.get(i);
        }
        return num;
    }
    private void postorder(TreeNode root,ArrayList<Integer> arr){
        if(root==null){
            return;
        }
        postorder(root.left,arr);
        postorder(root.right,arr);
        arr.add(root.val);
    } 
}