JZ26 二叉搜索树与双向链表 python

JZ26 二叉搜索树与双向链表

中序遍历

class Solution:
    def dfs(self, node):
        if not node:
            return 
        if node.left:
            self.dfs(node.left)
        node.left = self.pre
        if self.pre:
            self.pre.right = node
        self.pre = node
        if node.right:
            self.dfs(node.right)

    def Convert(self , pRootOfTree ):
        if not pRootOfTree:
            return 
        p = pRootOfTree
        while p.left:
            p = p.left
        list_start_node = p
        self.pre = None
        self.dfs(pRootOfTree)
        return list_start_node