lc145——二叉树的后序遍历

/**
 * 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> res=new ArrayList<Integer>();
   preorder(root,res);
   return res;
    }
    public void preorder(TreeNode root,List<Integer> res)
    {
    if(root==null)
    {
        return ;
    }
    preorder(root.left,res);
    preorder(root.right,res);
     res.add(root.val);
    }

    }