leetcode144. 二叉树的前序遍历

1.题目描述：

给你二叉树的根节点root，返回它节点值的前序遍历。

 2.递归前序遍历：

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

3.使用栈的迭代前序遍历：

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        while (!stack.isEmpty()) {
            TreeNode temp = stack.pop();
            if (temp == null) continue;
            list.add(temp.val);
            stack.push(temp.right);//可存入null
            stack.push(temp.left);
        }
        return list;
    }
}

更加容易理解的写法：

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        if (root == null) return list;
        stack.push(root);
        while (!stack.isEmpty()) {
            TreeNode temp = stack.pop();
            list.add(temp.val);
            if (temp.right != null) stack.push(temp.right);
            if (temp.left != null) stack.push(temp.left);
        }
        return list;
    }
}

4.Morris前序遍历：

详见leetcode94. 二叉树的中序遍历。

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<Integer>();
        TreeNode pre = null;
        while (root != null) {
            if (root.left != null) {
                pre = root.left;//找到左子树最右子节点pre
                while (pre.right != null && pre.right != root) {
                    pre = pre.right;
                }
                if (pre.right == null) {//让pre的右指针指向root，继续遍历左子树
                    list.add(root.val);
                    pre.right = root;
                    root = root.left;
                    continue;
                } else {//左子树访问完，抹去线索恢复原二叉树结构
                    pre.right = null;
                }
            } else {
                list.add(root.val);
            }
            root = root.right;//线索会走，抹完线索向右遍历
        }
        return list;
    }
}