剑指Offer39：二叉搜索树与双向链表

思路：

这个人家大佬的思路，还没学习懂，不知道思路是什么呜呜呜呜，递归是个很难搞懂的东东

#-*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def Convert(self, pRootOfTree):
        if not pRootOfTree:
            return pRootOfTree
        if not pRootOfTree.left and not pRootOfTree.right:
            return pRootOfTree
        
        # 处理左子树
        self.Convert(pRootOfTree.left)
        left=pRootOfTree.left
        
        # 连接根与左子树最大结点
        if left:
            while(left.right):
                left=left.right
            pRootOfTree.left,left.right=left,pRootOfTree
            
        # 处理右子树
        self.Convert(pRootOfTree.right)
        right=pRootOfTree.right
        
        # 连接根与右子树最小结点
        if right:
            while(right.left):
                right=right.left
            pRootOfTree.right,right.left=right,pRootOfTree
             
        while(pRootOfTree.left):
            pRootOfTree=pRootOfTree.left
        return pRootOfTree