[Leetcode] 426. Convert Binary Search Tree to Sorted Doubly Linked List

最新推荐文章于 2022-02-14 08:05:38 发布

Shlyan

最新推荐文章于 2022-02-14 08:05:38 发布

阅读量122

点赞数

分类专栏： LeetCode #tree

本文链接：https://blog.csdn.net/Renoler/article/details/102623295

版权

LeetCode 同时被 2 个专栏收录

70 篇文章 0 订阅

订阅专栏

#tree

3 篇文章 0 订阅

订阅专栏

Problem: https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/

Soluiton:
使用inorder traversal读取值，读出来的node和cur double linked
最后再把dummy node删除

class Solution {
    public Node treeToDoublyList(Node root) {
        // inorder traverse
        Stack<Node> stack = new Stack<>();
        if(root == null) return null;
        
        Node dummy = new Node(0);
        Node cur = dummy;
        
        Node temp = root;
        while(!stack.isEmpty() || temp != null) {
            while(temp != null) {
                stack.push(temp);
                temp = temp.left;
            }
            temp = stack.pop();
            cur.right = temp;
            temp.left = cur;
            temp = temp.right;
            cur = cur.right;
        }
        cur.right = dummy.right;
        dummy.right.left = cur;
        cur = cur.right;
        return cur;
    }
}