144.二叉树的前序遍历

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        preorder(root ,res);
        return 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);
    }
}

递归，同样适用于后序遍历和中序遍历