前中后序遍历二叉树

import java.util.ArrayList;
import java.util.List;

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        preorder(root,res);
        inorder(root,res);
        postorder(root,res);
        return res;

    }
    public void inorder(TreeNode root, List<Integer> res){
        if(root==null){return;}
        inorder(root.left,res);
        res.add(root.val);
        inorder(root.right,res);
    }
    public void preorder(TreeNode root, List<Integer> res){
        if(root==null){return;}
        res.add(root.val);
        preorder(root.left,res);
        preorder(root.right,res);
    }
    public void postorder(TreeNode root, List<Integer> res){
        if(root==null){return;}
        postorder(root.left,res);
        postorder(root.right,res);
        res.add(root.val);
    }
}