leetcode 114. Flatten Binary Tree to Linked List (medium)

https://leetcode.com/problems/flatten-binary-tree-to-linked-list/
用分治的思想。
对于一个节点，lastLeft表示节点最左的叶子节点，lastRight表示最右的叶子节点，对每个节点执行以下三步操作：

1. 因为左子树的链接优先级都是高于右子树的，若lastLeft存在，执行lastLeft.left = root.right，若不存在左叶子节点，则右子树保留
2. 将所有左子树调换到右root.right = root.left
3. 原先的左节点置空root.left = null

in-place链接完节点之后，需要根据

if lastRight != None:   return lastRight
if lastLeft != None:   return lastLeft
return root

来返回节点。

python

class Solution:
    def flatten(self, root: TreeNode) -> None:
        """
        Do not return anything, modify root in-place instead.
        """
        self.dfs(root)
    
    def dfs(self, root):
        # 如果节点为空，返回空
        if root == None:    return None
        
        lastLeft = self.dfs(root.left)
        lastRight = self.dfs(root.right)
        """
        1) link the right node of root to the last left node of root
        2) link the root.left to the root.right
        3) set root.left None
        """
        if lastLeft != None:
            lastLeft.right = root.right
            root.right = root.left
            root.left = None
        
        """
        we should return a node for next node to link
        """
        if lastRight != None:   return lastRight
        if lastLeft != None:   return lastLeft
        return root