[LeetCode] Binary Tree Preorder Traversal

Total Accepted: 14712 Total Submissions: 42788

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?

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