LeetCode 8 Binary Tree Preorder Traversal

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

分析：前序，中序，后序遍历的非递归解法，都是利用一个栈，将父节点压栈。其中，后序处理起来比较麻烦一点，前序和中序都比较直观。

递归解法

/**
 * 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> result = new ArrayList<Integer>();
        preorderTraversal(root, result);
        return result;
    }
    private void preorderTraversal(TreeNode node, List<Integer> result){
        if(node == null) return;
        result.add(node.val);
        if(node.left != null)
            preorderTraversal(node.left, result);
        if(node.right != null)
            preorderTraversal(node.right, result);
    }
}

非递归解法

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