二叉树的前序遍历时先访问根,然后左边,再右边;
我们递归分别访问根,左,右,把他们的值存储到ArrayList;
然后返回这个ArrayList;
/**
* 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 {
private List<Integer>l = new ArrayList<>();
public List<Integer> preorderTraversal(TreeNode root) {
if(root!=null){
l.add(root.val);
preorderTraversal(root.left);
preorderTraversal(root.right);
return l;
}else
return l;
}
}