[吊打面试官-力扣经典题]力扣-145. 二叉树的后序遍历

145. 二叉树的后序遍历 - 力扣（LeetCode）

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
  List<Integer> list =  new ArrayList<>();
          pos(root,list);
          return list;
    }
  public void pos(TreeNode root , List<Integer> list){
         if(root != null){
                                
           pos(root.left, list);
           pos(root.right,list);
           list.add(root.val); 
         }
     }
}