二叉树前序、中序、后序非递归遍历【JAVA】

最新推荐文章于 2022-06-29 16:46:54 发布

年华易逝Temper

最新推荐文章于 2022-06-29 16:46:54 发布

阅读量141

点赞数

分类专栏： LeetCode刷题文章标签： LeetCode 二叉树遍历 JAVA

本文链接：https://blog.csdn.net/qq_32133499/article/details/84504360

版权

LeetCode刷题专栏收录该内容

1 篇文章 0 订阅

订阅专栏

记录LeetCode刷题，可能有待改进

前序非递归

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

中序非递归

public List<Integer> inorderTraversal(TreeNode root) {
    List<Integer> list = new ArrayList<>();
    if (root == null) return list;
    Stack<TreeNode> stack = new Stack<>();
    stack.push(root);
    TreeNode pointer;
    while (!stack.empty()) {
        pointer = stack.pop();
        if (pointer != null) {
            stack.push(pointer.right);
            stack.push(pointer);
            stack.push(pointer.left);
        }
        if (pointer == null && !stack.empty()) {
            pointer = stack.pop();
            list.add(pointer.val);
        }
    }
    return list;
}

后序非递归

public List<Integer> postorderTraversal(TreeNode root) {
   List<Integer> list = new ArrayList<>();
    if (root == null) return list;
    Stack<TreeNode> stack = new Stack<>();
    Set<TreeNode> set = new HashSet<>();
    stack.push(root);
    TreeNode pointer;
    while (!stack.empty()) {
        pointer = stack.pop();
        if (pointer != null) {
            if (!set.contains(pointer)) {
                set.add(pointer);
                stack.push(pointer);
                stack.push(pointer.right);
                stack.push(pointer.left);
            }else {
                list.add(pointer.val);
            }
        }
    }
    return list;
}