class Solution { List<Integer> res = new ArrayList<>(); public List<Integer> preorderTraversal(TreeNode root) { dfs(root); return res; } public void dfs(TreeNode root){ if(root==null){ return; } res.add(root.val); dfs(root.left); dfs(root.right); } } class Solution { public List<Integer> preorderTraversal(TreeNode root) { List<Integer> res = new ArrayList<>(); dfs(root,res); return res; } public void dfs(TreeNode root,List<Integer>res){ if(root==null){ return; } res.add(root.val); dfs(root.left,res); dfs(root.right,res); } }