【LeetCode】-Binary Tree Inorder Traversal

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

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

   1
    \
     2
    /
   3

return [1,3,2].

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

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