非递归二叉树操作.md

最新推荐文章于 2018-03-27 15:58:17 发布

木工当道

最新推荐文章于 2018-03-27 15:58:17 发布

阅读量184

点赞数

分类专栏：算法文章标签：二叉树 java 递归栈

本文链接：https://blog.csdn.net/limao693/article/details/73330930

版权

算法专栏收录该内容

34 篇文章 0 订阅

订阅专栏

使用单栈进行二叉树非递归操作。
具体的Java版本代码为：

protected static void nonIterativePreorder(Node p) {    
    Stack<Node> stack = new Stack<Node>();    
    Node node = p;    
    while (node != null || stack.size() > 0) {    
        while (node != null) {
            visit(node);    
            stack.push(node);    
            node = node.getLeft();    
        }    
        if (stack.size() > 0) { 
            node = stack.pop();    
            node = node.getRight();    
        }    
    }    
} 

 protected static void noniterativeInorder(Node p) {    
    Stack<Node> stack = new Stack<Node>();    
    Node node = p;    
    while (node != null || stack.size() > 0) {    
        while (node != null) {    
            stack.push(node);    
            node = node.getLeft();    
        }    
        if (stack.size() > 0) {    
            node = stack.pop();    
            visit(node);
            node = node.getRight();    
        }    
    }    
}

 protected static void noniterativePostorder(Node p) {    
    Stack<Node> stack = new Stack<Node>();    
    Node node = p, prev = p;    
    while (node != null || stack.size() > 0) {    
        while (node != null) {    
            stack.push(node);    
            node = node.getLeft();    
        }    
        if (stack.size() > 0) {    
            Node temp = stack.peek().getRight();    
            if (temp == null || temp == prev) {    
                node = stack.pop();    
                visit(node);    
                prev = node;    
                node = null;    
            } else {    
                node = temp;    
            }    
        }
    }    
}