今天进入二叉树专题了,加油
class Solution {
public void Traversal(TreeNode root, List<Integer> result){
if(root != null){
result.add(root.val);
Traversal(root.left, result);
Traversal(root.right, result);
}
}
public List<Integer> preorderTraversal(TreeNode root) {
ArrayList<Integer> result = new ArrayList<>();
Traversal(root, result);
return result;
}
}