题目
给你二叉树的根节点 root ,返回它节点值的前序遍历。
题解
根左右
/**
* 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 {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
if(root == null) return res;
preOrder(root, res);
return res;
}
public void preOrder(TreeNode root, List<Integer> res) {
res.add(root.val);
if(root.left != null) preOrder(root.left, res);
if(root.right != null) preOrder(root.right, res);
}
}