Java——使用stack实现二叉树的前中后序遍历

最新推荐文章于 2024-05-18 11:09:56 发布

你知道烟火吗

最新推荐文章于 2024-05-18 11:09:56 发布

阅读量364

点赞数 6

分类专栏： java 文章标签： java 开发语言

本文链接：https://blog.csdn.net/Wanankl/article/details/136342251

版权

java 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

public class Traversal {

    public static 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;
        }
    }

    public static void main(String[] args) {

    }

    // 栈实现先序遍历
    public static List<Integer> stackPreorder(TreeNode root){
        List<Integer> result = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        while (!stack.isEmpty()){
            TreeNode pop = stack.pop();
            if (null != pop){
                if (null != pop.right){
                    stack.push(pop.right);
                }
                if (null != pop.left){
                    stack.push(pop.left);
                }
                stack.push(pop);
                stack.push(null); // 用作标记输出
            } else {
                result.add(stack.pop().val);
            }
        }
        return result;
    }

    // 栈实现中序遍历
    public static List<Integer> stackInorder(TreeNode root){
        List<Integer> result = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        while (!stack.isEmpty()){
            TreeNode pop = stack.pop();
            if (null != pop){
                if (null != pop.right){
                    stack.push(pop.right);
                }
                stack.push(pop);
                stack.push(null);
                if (null != pop.left){
                    stack.push(pop.left);
                }
            } else {
                result.add(stack.pop().val);
            }
        }
        return result;
    }

    // 栈实现后序遍历
    public static List<Integer> stackPostorder(TreeNode root){
        List<Integer> result = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        while (!stack.isEmpty()){
            TreeNode pop = stack.pop();
            if (null != pop){
                stack.push(pop);
                stack.push(null);
                if (null != pop.right){
                    stack.push(pop.right);
                }
                if (null != pop.left){
                    stack.push(pop.left);
                }
            } else {
                result.add(stack.pop().val);
            }
        }
        return result;
    }
}