Binary Tree Inorder Traversal --- LeetCode

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.

解题思路： 非递归中序遍历二叉树：使用stack

/**
 * 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> rs=new ArrayList<Integer>();
      Stack<TreeNode> stack=new Stack<TreeNode>();
           if(root==null){
     return rs;
      }
           TreeNode node=root;
      while(!stack.isEmpty()||node!=null){
                 while(node!=null){
                stack.push(node);
                node=node.left;
                 }    
        if(!stack.isEmpty()){
        node=stack.pop();
        rs.add(node.val);
        node=node.right;
        }
                    
      }       
           return rs;
    }
}