LeetCode 145. Binary Tree Postorder Traversal

题目地址：https://leetcode.com/problems/binary-tree-postorder-traversal/description/

思路：二叉树的后序遍历

AC代码（递归实现）

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    List<Integer> vals = new ArrayList<>();

    public List<Integer> postorderTraversal(TreeNode root) {
        if (root != null) {
            if (root.left != null) {
                this.postorderTraversal(root.left);
            }
            if (root.right != null) {
                this.postorderTraversal(root.right);
            }
            vals.add(root.val);
        }
        return vals;
    }
}