已结束

[labuladong]

本期打卡已结算完成。报名最新一期的打卡活动 点这里

[CarolSSS]

https://leetcode.com/problems/flatten-binary-tree-to-linked-list/solutions/3916510/recursion/

[DannyT70]

https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/solution/er-cha-shu-2-by-sleepy-shawffi-5foy/

[DannyT70]

https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/solution/er-cha-shu-2-by-sleepy-shawffi-5foy/

[KarlZhu-SE]

https://leetcode.com/problems/flatten-binary-tree-to-linked-list/solutions/3916905/flatten/

[alyssasuper3]

https://leetcode.cn/problems/invert-binary-tree/solutions/2391260/fan-zhuan-er-cha-shu-by-alyssasuper3-o660/

[imzhuting]

https://leetcode.cn/problems/invert-binary-tree/solutions/2391273/fan-zhuan-er-cha-shu-by-emilia-8-191x/

[Sadwy]

LC114. https://leetcode.com/problems/flatten-binary-tree-to-linked-list/solutions/3917102/topic/

[AstrKing]

226：https://leetcode.cn/problems/invert-binary-tree/solutions/2070398/fan-zhuan-er-cha-shu-by-aktrking-y50b/

[cs-gavin-huang]

https://leetcode.com/problems/populating-next-right-pointers-in-each-node/solutions/3918191/populating-next-right-pointers-in-each-node/

[tonyzhu163]

# Aug 16 

# LC Invert Tree
# recusive solution is straightforward
# traverse solution do inversion and then traverse

class Solution:
    def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
        if not root:
            return

        left = self.invertTree(root.left)
        right = self.invertTree(root.right)

        root.left = right
        root.right = left

        return root

[ElaineZhou-moon]

https://leetcode.com/problems/invert-binary-tree/solutions/3918628/invert-binary-tree/

[YilinYan0]

https://leetcode.com/problems/invert-binary-tree/post-solution/?submissionId=1023146475