zoukankan      html  css  js  c++  java
  • [LC] 426. Convert Binary Search Tree to Sorted Doubly Linked List

    Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to the previous and next pointers in a doubly-linked list.

    Let's take the following BST as an example, it may help you understand the problem better:

     

     

    We want to transform this BST into a circular doubly linked list. Each node in a doubly linked list has a predecessor and successor. For a circular doubly linked list, the predecessor of the first element is the last element, and the successor of the last element is the first element.

    The figure below shows the circular doubly linked list for the BST above. The "head" symbol means the node it points to is the smallest element of the linked list.

     

     

    Specifically, we want to do the transformation in place. After the transformation, the left pointer of the tree node should point to its predecessor, and the right pointer should point to its successor. We should return the pointer to the first element of the linked list.

    The figure below shows the transformed BST. The solid line indicates the successor relationship, while the dashed line means the predecessor relationship.

     

     
    Solution 1:
    Make use of dummy node for temporarily prev head for doubly linked list
    """
    # Definition for a Node.
    class Node:
        def __init__(self, val, left, right):
            self.val = val
            self.left = left
            self.right = right
    """
    class Solution:
        def treeToDoublyList(self, root: 'Node') -> 'Node':
            if root is None:
                return
            dummy = Node(-1, None, None)
            self.prev = dummy
            self.helper(root)
            self.prev.right = dummy.right
            dummy.right.left = self.prev
            return dummy.right
        
        def helper(self, cur):
            if cur is None:
                return
            self.helper(cur.left)    
            self.prev.right = cur
            cur.left = self.prev
            self.prev = cur
            self.helper(cur.right)
     
    Solution 2:
    Use head to record the real head when find it
    """
    # Definition for a Node.
    class Node:
        def __init__(self, val, left, right):
            self.val = val
            self.left = left
            self.right = right
    """
    class Solution:
        def treeToDoublyList(self, root: 'Node') -> 'Node':
            if root is None:
                return
            self.prev, self.head = None, None
            self.helper(root)
            self.prev.right = self.head
            self.head.left = self.prev
            return self.head
        
        def helper(self, cur):
            if cur is None:
                return
            self.helper(cur.left)    
            if self.prev is None:
                self.head = cur
            else:
                self.prev.right = cur
                cur.left = self.prev
            self.prev = cur
            self.helper(cur.right)
     
  • 相关阅读:
    在VMWare中增加Linux文件系统空间
    linux shell 字符串操作(长度,查找,替换)详解
    linux chmod命令参数及用法详解文件文件夹权限设定命令
    Linux分割日志计划任务(原创)
    写日志C#程序
    2011年底,数家大型网站数据库被窃取分析报告(原创)
    ThinkPad SL400全驱动
    东辰信竞学子——从今天开始重新出发!
    CentOS7下安装mysql8027
    arcgis基础
  • 原文地址:https://www.cnblogs.com/xuanlu/p/11750142.html
Copyright © 2011-2022 走看看