Leetcode BST Preorder Traverse

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?

Binary Search Tree:

• The left subtree of a node contains only nodes with keys less than the node's key.
• The right subtree of a node contains only nodes with keys greater than the node's key.
• The left and right subtree each must also be a binary search tree.
• Each node can have up to two successor nodes.
• There must be no duplicate nodes.
• A unique path exists from the root to every other node.

Preorder Traverse:

1. Display the data part of root element (or current element).
2. Traverse the left subtree by recursively calling the pre-order function.
3. Traverse the right subtree by recursively calling the pre-order function.

Pre-order: F, B, A, D, C, E, G, I, H

java code ：recursive solution:

/** 
 * Definition for binary tree 
 * public class TreeNode { 
 *     int val; 
 *     TreeNode left; 
 *     TreeNode right; 
 *     TreeNode(int x) { val = x; } 
 * } 
 */  
public class Solution {  
    public ArrayList<Integer> preorderTraversal(TreeNode root) {  
        // IMPORTANT: Please reset any member data you declared, as  
        // the same Solution instance will be reused for each test case.  
        ArrayList<Integer> res = new ArrayList<Integer>();  
         if(root == null)  
             return res;  
         pre(res,root);  
         return res;  
    }  
    public void pre(ArrayList<Integer> res, TreeNode root)  
     {  
         res.add(root.val);  
         if(root.left != null)  
             pre(res, root.left);  
         if(root.right != null)  
             pre(res, root.right);  
     }  
}  

iteratively solution:

/** 
 * Definition for binary tree 
 * public class TreeNode { 
 *     int val; 
 *     TreeNode left; 
 *     TreeNode right; 
 *     TreeNode(int x) { val = x; } 
 * } 
 */  
public class Solution {  
    public ArrayList<Integer> preorderTraversal(TreeNode root) {  
        // IMPORTANT: Please reset any member data you declared, as  
        // the same Solution instance will be reused for each test case.  
        ArrayList<Integer> res = new ArrayList<Integer>();  
         if(root == null)  
             return res;  
         Stack<TreeNode> st = new Stack<TreeNode>();  
         st.push(root);  
         while(!st.isEmpty())  
         {  
             TreeNode cur = st.peek();  
             res.add(cur.val);  
             st.pop();  
             if(cur.right != null)  
                 st.push(cur.right);  
             if(cur.left != null)  
                 st.push(cur.left);  
         }  
         st = null;  
         return res;  
    }  
      
}