二叉树遍历

最新推荐文章于 2024-01-27 15:36:29 发布

SuperLonelyCat

最新推荐文章于 2024-01-27 15:36:29 发布

阅读量270

点赞数 1

分类专栏：算法文章标签：二叉树遍历前序遍历中序遍历后序遍历

本文链接：https://blog.csdn.net/Mr_FLM/article/details/102740867

版权

算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

一、前序遍历：根 -> 左 -> 右

1、以递归的方式前序遍历二叉树

public static void preorderByRecursion(TreeNode root, List<Integer> list) {
	if (root == null) {
	   return;
	}
	list.add(root.value);
	preorderByRecursion(root.left, list);
	preorderByRecursion(root.right, list);
}

2、以栈的方式前序遍历二叉树

public static void preorderByStack(TreeNode root, List<Integer> list) {
    Stack<TreeNode> stack = new Stack<>();
    while (root != null || !stack.empty()) {
        while (root != null) {
            list.add(root.value);
            stack.push(root);
            root = root.left;
        }
        if (!stack.empty()) {
            root = stack.pop().right;
        }
    }
}

二、中序遍历：左 -> 根 -> 右

1、以递归的方式中序遍历二叉树

public static void inorderByRecursion(TreeNode root, List<Integer> list) {
    if (root == null) {
        return;
    }
    inorderByRecursion(root.left, list);
    list.add(root.value);
    inorderByRecursion(root.right, list);
}

2、以栈的方式中序遍历二叉树

public static void inorderByStack(TreeNode root, List<Integer> list) {
    Stack<TreeNode> stack = new Stack<>();
    while (root != null || !stack.empty()) {
        while (root != null) {
            stack.push(root);
            root = root.left;
        }
        if (!stack.empty()) {
            root = stack.pop();
            list.add(root.value);
            root = root.right;
        }
    }
}

三、后序遍历：左 -> 右 -> 根

1、以递归的方式后序遍历二叉树

public static void postorderByRecursion(TreeNode root, List<Integer> list) {
    if (root == null) {
        return;
    }
    postorderByRecursion(root.left, list);
    postorderByRecursion(root.right, list);
    list.add(root.value);
}

2、以栈的方式后序遍历二叉树

public static void postorderByStackInRight(TreeNode root, List<Integer> list) {
    Stack<TreeNode> nodeStack = new Stack<>();
    Stack<Integer> resultStack = new Stack<>();
    while (root != null || !nodeStack.empty()) {
        while (root != null) {
            nodeStack.push(root);
            resultStack.push(root.value);
            root = root.right;
        }
        if (!nodeStack.empty()) {
            root = nodeStack.pop().left;
        }
    }
    while (!resultStack.empty()) {
        list.add(resultStack.pop());
    }
}