LeetCode--binary-tree-preorder-traversal

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

For example:
Given binary tree{1,#,2,3},

   1
    \
     2
    /
   3

 

return[1,2,3].

Note: Recursive solution is trivial, could you do it iteratively?

前序递归遍历二叉树

import java.util.*;
/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    ArrayList<Integer> num=new ArrayList<Integer>();
    public ArrayList<Integer> preorderTraversal(TreeNode root) {
         if(root == null){
             return num;
         }
        num.add(root.val);
        preorderTraversal(root.left);
        preorderTraversal(root.right);
        return num;
    }
}