题解 | #二叉搜索树与双向链表#

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

#
# 
# @param pRootOfTree TreeNode类 
# @return TreeNode类
#
class Solution:
    def Convert(self , pRootOfTree ):
        # write code here
        if not pRootOfTree:
            return
        print(pRootOfTree.val)
        if not pRootOfTree.left and not pRootOfTree.right:
            return pRootOfTree
        if pRootOfTree.left:
            cpl= self.Convert(pRootOfTree.left)
            print(cpl.val)
            while cpl.right:
                cpl=cpl.right
            cpl.right=pRootOfTree
            pRootOfTree.left=cpl
        if pRootOfTree.right:
            cpr=self.Convert(pRootOfTree.right)
            print(cpr.val)
            cpr.left=pRootOfTree
            pRootOfTree.right=cpr
        while pRootOfTree.left:
            pRootOfTree=pRootOfTree.left
        return pRootOfTree