问:
给你二叉树的根节点 root ,返回它节点值的 前序 遍历。
原题链接:https://leetcode.cn/problems/binary-tree-preorder-traversal/
例:
输入:root = [1,null,2,3]
输出:[1,2,3]
答:前序遍历 根节点->左->右
/**
* 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> list = new ArrayList<Integer>();
preorder(root,list);
return list;
}
public void preorder(TreeNode root,List<Integer> list){
if(root == null)
return;
list.add(root.val);
preorder(root.left,list);
preorder(root.right,list);
}
}