Binary Tree Preorder Traversal

Problem:

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?

Solution:

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        
        Stack<TreeNode> st = new Stack<TreeNode>();
        TreeNode p = root;
        List<Integer> list = new ArrayList<Integer>();
        if(p==null)
         return list;
        while(p!=null)
        {
         while(p!=null)
         {
         list.add(p.val);
         if(p.right!=null)
         st.push(p.right);
         p = p.left;
         }
         if(st.empty())
         break;
         else
         p = st.pop();
        }
        return list;
    
    }
}