Binary Tree Preorder Traversal ---- LeetCode

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