LintCode Binary Tree Preorder Traversal二叉树的前序遍历（非递归）

给出一棵二叉树，返回其节点值的前序遍历。
Given a binary tree, return the preorder traversal of its nodes’ values.

样例
给出一棵二叉树 {1,#,2,3},
1
\
2
/
3
返回 [1,2,3].
1）将二叉树节点入栈（入栈之前输出该节点值），直到左孩子为null为止。
2）出栈一个节点，有右节点时，将其右节点入栈（入栈之前输出该节点值）返回步骤1）；若无右节点则继续出栈，直到栈为空为止。

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: Preorder in ArrayList which contains node values.
     */
    public ArrayList<Integer> preorderTraversal(TreeNode root) {
        ArrayList<Integer> list = new ArrayList<Integer>();
        if(root == null) return list;
        Stack<TreeNode> stack = new Stack<TreeNode>();
        TreeNode p = root;
        while(p != null || !stack.empty()) {
            while(p != null) {
                stack.push(p);
                list.add(p.val);
                p = p.left;
            }
            if(!stack.empty()) {
                p = stack.pop();
                p = p.right;
            }
        }
        return list;
    }
}