题解 | 二叉树的后序遍历

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) {
        // write code here
        if (root == null) return new int[0];
        List<Integer> list = new ArrayList<>();
        int[] res;
        postorder(list, root);
        res = new int[list.size()];
        for (int i = 0; i < res.length; i++) res[i] = list.get(i);
        return res;
    }

    private void postorder(List<Integer> list, TreeNode root) {
        // TODO
        if (root.left != null) postorder(list, root.left);
        if (root.right != null) postorder(list, root.right);
        list.add(root.val);
    }
}