144. Binary Tree Preorder Traversal（二叉树）

题目来源：https://leetcode.com/problems/binary-tree-preorder-traversal/

问题描述

144. Binary Tree Preorder Traversal

Medium

Given a binary tree, return the preordertraversal of its nodes' values.

Example:

Input: [1,null,2,3]

   1

    \

     2

    /

   3

 

Output: [1,2,3]

------------------------------------------------------------

题意

二叉树的先序遍历

------------------------------------------------------------

思路

递归

------------------------------------------------------------

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> ans = new ArrayList<Integer>();
        dfs(root, ans);
        return ans;
    }
    
    private void dfs(TreeNode root, List<Integer> ans) {
        if (root == null) {
            return;
        }
        ans.add(root.val);
        dfs(root.left, ans);
        dfs(root.right, ans);
    }
}