leetcode-114-二叉樹展開爲鏈表*

題目描述：   方法一：迭代 class Solution: def flatten(self, root: TreeNode) -> None: """ Do not return anything, modify root in-place instead. """ cur = root while cu

>>阅读原文<<