leetcode -- Flatten Binary Tree to Linked List -- 重点难点

最新推荐文章于 2024-10-01 05:07:35 发布

xyqzki

最新推荐文章于 2024-10-01 05:07:35 发布

阅读量410

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/xyqzki/article/details/50244049

版权

leetcode 专栏收录该内容

257 篇文章 0 订阅

订阅专栏

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

关于tree的问题，首先要想到递归的办法

参考http://www.cnblogs.com/zuoyuan/p/3721157.html

正确的code：

class Solution(object):
    def flatten(self, root):
        """
        :type root: TreeNode
        :rtype: void Do not return anything, modify root in-place instead.
        """
        if not root: return
        self.flatten(root.left)
        self.flatten(root.right)

        p = root.left
        if root.left == None :return
        while p.right:
            p = p.right
        tmp = root.right
        root.right = root.left
        p.right = tmp
        root.left = None

我的code，暂时保存在这里，有问题。即如何用iterative的方法实现这个问题？

class Solution(object):
    def flatten(self, root):
        """
        :type root: TreeNode
        :rtype: void Do not return anything, modify root in-place instead.
        """
        if not root: return None
        stack = []
        pre = root
        while stack or root:
            if root:
                stack.append(root)
                root = root.left

            else:


                tmp = stack[-1]
                root = stack.pop()

                if pre == root.left and root.right:
                    pre.right = root.right
                    root.left, root.right = None, pre

                pre = tmp

                root = root.right
        return root