题解 | 二叉树的后序遍历

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
        List<Integer> post = new ArrayList<>();
	  	// 后序遍历：左、右、根
        postOrder(root, post);
        return post.stream().mapToInt(i -> i).toArray();
    }
    private void postOrder(TreeNode root, List<Integer> post) {
        if (root == null) return;
        postOrder(root.left, post);
        postOrder(root.right, post);
        post.add(root.val);
    }
}