My code:

import java.util.ArrayList;
import java.util.List;

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        ArrayList<Integer> result = new ArrayList<Integer>();
        if (root == null)
            return result;
        preorder(root, result);
        return result;
    }
    
    private void preorder(TreeNode root, ArrayList<Integer> result) {
        result.add(root.val);
        if (root.left != null)
            preorder(root.left, result);
        if (root.right != null)
            preorder(root.right, result);
    }
        
}

My test result:

考先序遍歷的舰讹，沒(méi)什么好說(shuō)的。

非遞歸寫法：

    public List<TreeNode> preOrder(TreeNode root) {
        if (root == null)
            return null;
        TreeNode p = root;
        Stack<TreeNode> s = new Stack<TreeNode>();
        ArrayList<TreeNode> result = new ArrayList<TreeNode>();
        while (p != null || !s.isEmpty()) {
            while (p != null) {
                result.add(p);
                s.push(p);
                p = p.left;
            }
            
            if (!s.isEmpty()) {
                p = s.pop();
                p = p.right;        
            }
        }
        return result;
    }

**
總結(jié)： pre order tree
**

Anyway, Good luck, Richardo!

My code:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        ArrayList<Integer> ret = new ArrayList<Integer>();
        if (root == null)
            return ret;
        Stack<TreeNode> s = new Stack<TreeNode>();
        TreeNode node = root;
        while (node != null) {
            ret.add(node.val);
            if (node.right != null)
                s.push(node.right);
            node = node.left;
            if (node == null && !s.isEmpty()) {
                node = s.pop();
            }
        }
        return ret;
    }
}

這是我的寫法。就是每次訪問(wèn)當(dāng)前結(jié)點(diǎn)，然后如果right child != null, 壓入棧中。
curr = curr.left;
然后判斷 curr 是否為 null.如果是鄙早，表示走到頭了。那就從棧中彈出元素椅亚，開(kāi)始訪問(wèn)右側(cè)限番。
注意循環(huán)判斷條件得是 node != null 而不是棧是否為空。

Anyway, Good luck, Richardo!

My code:

/**
 * Definition for a binary tree node.
 * 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> ret = new ArrayList<Integer>();
        if (root == null) {
            return ret;
        }
        Stack<TreeNode> st = new Stack<TreeNode>();
        TreeNode p = root;
        while (p != null || !st.isEmpty()) {
            while (p != null) {
                ret.add(p.val);
                st.push(p);
                p = p.left;
            }
            p = st.pop().right;
        }
        
        return ret;
    }
}

復(fù)習(xí)了下 iteration的寫法什往，但還是沒(méi)能寫出來(lái)扳缕，看了答案。

Anyway, Good luck, Richardo! -- 09/06/2016

Morris traversal:

My code:

/**
 * Definition for a binary tree node.
 * 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> ret = new ArrayList<Integer>();
        if (root == null) {
            return ret;
        }
        
        TreeNode curr = root;
        while (curr != null) {
            if (curr.left == null) {
                ret.add(curr.val);
                curr = curr.right;
            }
            else {
                TreeNode pre = curr.left;
                while (pre.right != null && pre.right != curr) {
                    pre = pre.right;
                }
                
                if (pre.right == null) {
                    ret.add(curr.val);
                    pre.right = curr;
                    curr = curr.left;
                }
                else {
                    pre.right = null;
                    curr = curr.right;
                }
            }
        }
        
        return ret;
    }
}

reference:
http://www.cnblogs.com/AnnieKim/archive/2013/06/15/morristraversal.html

Anyway, Good luck, Richardo! -- 09/08/2016