二叉树的遍历操作

二叉树的遍历操作

二叉树的一项主要操作是对所有节点的遍历，包括前序遍历、中序遍历、后序遍历以及层序遍历，可以通过递归或是迭代的方式实现

二叉树的前序遍历

• 递归实现

public void preorderTraversal(TreeNode root) {
    List<Integer> res = new ArrayList<Integer>();

    if (root != null) {
        res.add(root.value);
        preorderTraversal(root.left);
        preorderTraversal(root.right);
    }
    else
        return ;
}

• 迭代实现

public void preorderTraversal(TreeNode root) {
    Stack<TreeNode> stack = new Stack<TreeNode>(); 
    List<Integer> res = new ArrayList<Integer>();

    while (root != null && !stack.isEmpty()) {
        while (root != null) {
            res.add(root.value);
            stack.push(root);
            root = root.left;
        }
        if (!stack.isEmpty()) {
            root = stack.pop();
            root = root.right;
        }
    }
}

二叉树的中序遍历

• 递归实现

public void inorderTraversal(TreeNode root) {
    List<Integer> res = new ArrayList<Integer>();

    if (root != null) {
        inorderTraversal(root.left);
        res.add(root.value);
        inorderTraversal(root.right);
    }
    else
        return ;
}

• 迭代实现

public void inorderTraversal(TreeNode root) {
    Stack<TreeNode> stack = new Stack<TreeNode>(); 
    List<Integer> res = new ArrayList<Integer>();

    while (root != null && !stack.isEmpty()) {
        while (root != null) {
            stack.push(root);
            root = root.left;
        }
        if (!stack.isEmpty()) {
            root = stack.pop();
            res.add(root.value);
            root = root.right;
        }
    }
}

二叉树的后序遍历

• 递归实现

public void preorderTraversal(TreeNode root) {
    Stack<TreeNode> stack = new Stack<TreeNode>(); 
    List<Integer> res = new ArrayList<Integer>();

    while (root != null && !stack.isEmpty()) {
        while (root != null) {
            res.add(root.value);
            stack.push(root);
            root = root.left;
        }
        if (!stack.isEmpty()) {
            root = stack.pop();
            root = root.right;
        }
    }
}

• 迭代实现

public void postorderTraversal(TreeNode root) {
    Stack<TagTreeNode> stack = new Stack<TagTreeNode>(); 
    List<Integer> res = new ArrayList<Integer>();

    while (root != null && !stack.isEmpty()) {
        while (root != null) {
            TagTreeNode tempNode = new TagTreeNode();
            tempNode.treeNode = root;
            tempNode.isFirst = true;
            stack.push(tempNode);
            root = root.left;
        }
        if (!stack.isEmpty()) {
            TagTreeNode tempNode = new TagTreeNode();
            tempNode = stack.pop();
            if (tempNode.isFirst) {
                tempNode.isFirst = false;
                stack.push(tempNode);
                root = tempNode.treeNode.right;
            }
            else {
                res.add(tempNode.treeNode.value);
                root = null;
            }
        }
    }
}

class TagTreeNode {
    public TreeNode treeNode = new TreeNode();
    public boolean isFirst = true;
}