LeetCode 114. Flatten Binary Tree to Linked List

题目描述

将二叉树转换成列表

解题思路

递归拆分。对于一个根节点 root，其左子树的列表一定在右子树列表上方，故若知道 root 的左右子成分，那么最后的结果也就出来了。

代码

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
import copy

class Solution:
    def flatten(self, root: Optional[TreeNode]) -> None:
        """
        Do not return anything, modify root in-place instead.
        """
        self.helper(root)
    
    def helper(self, root):
        if not root:
            return None
        flatten_left = self.helper(root.left)
        flatten_right = self.helper(root.right)
        if not flatten_left:
            if flatten_right:
                root.right = flatten_right
                root.left = None

        else:
            last = flatten_left
            while last.right:
                last = last.right
            last.right = flatten_right
            root.right = flatten_left
            root.left = None
            
        return root