leetcode 面试题36 二叉搜索树与双向链表

解题思路：要将二叉搜索树转化为排序的循环双向链表，因为二叉树的性质我们知道左子树的所有节点都小于根节点，所有右子树的节点都大于根节点，我们可以递归的去求解双向链表，先分别求得做左子树的循环双向链表，再求得右子树循环双向链表，再用各节点将两个链表链表连接起来得到肯定是排序的链表，因为是要构成循环链表，所以要同时修改三个节点的指针指向根节点、头节点和尾节点，注意先后顺序，以及考虑到子树为空的情况就可以了

"""
# Definition for a Node.
class Node:
    def __init__(self, val, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right
"""
class Solution:
    def treeToDoublyList(self, root: 'Node') -> 'Node':
        if root is None:
            return root
        right, left = None, None
        if root.right:
            right = self.treeToDoublyList(root.right)
        if root.left:
            left = self.treeToDoublyList(root.left)
        p = root 
        if right:
            last = right.left
            p.left = last
            last.right = p
            right.left = p
            p.right = right
        else:
            p.left = p
            p.right = p
        if left:
            root = left
            last = left.left
            rightlast = p.left
            p.left = last
            last.right = p
            left.left = rightlast
            rightlast.right = left
        return root