力扣-二叉树的前序遍历

给一个二叉树的根节点 root ，返回它节点值的 前序遍历。

例如：

输入：root = [1,null,2,3]
输出：[1,2,3]

输入：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> list = new ArrayList<>();
        if (root == null){
            return list;
        }
        System.out.print(root.val + " ");
        list.add(root.val);

        List<Integer> left = preorderTraversal(root.left);
        list.addAll(left);

        List<Integer> right = preorderTraversal(root.right);
        list.addAll(right);

        return list;
    }
}

运行截图：