LeetCode 144. Binary Tree Preorder Traversal（二叉树前缀遍历）

原题网址：https://leetcode.com/problems/binary-tree-preorder-traversal/

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 a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    private List<Integer> result = new ArrayList<>();
    private void preorder(TreeNode node) {
        if (node == null) return;
        result.add(node.val);
        preorder(node.left);
        preorder(node.right);
    }
    public List<Integer> preorderTraversal(TreeNode root) {
        preorder(root);
        return result;
    }
}

方法二：用栈模拟递归。

/**
 * 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> traversal = new ArrayList<>();
        Stack<TreeNode> nodes = new Stack<>();
        Stack<Integer> states = new Stack<>();
        nodes.push(root);
        states.push(1);
        while (!nodes.isEmpty()) {
            TreeNode node = nodes.pop();
            int state = states.pop();
            if (state == 1) {
                if (node == null) continue;
                traversal.add(node.val);
                nodes.push(node);
                states.push(2);
                nodes.push(node.left);
                states.push(1);
                continue;
            } else if (state == 2) {
                nodes.push(node);
                states.push(3);
                nodes.push(node.right);
                states.push(1);
                continue;
            } else {
                // state == 3, nothing to do
            }
        }
        return traversal;
    }
}

方法三：由于是前缀遍历，不存在先访问子节点再访问父节点的问题，可以简化栈操作。

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