114. Flatten Binary Tree to Linked List

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

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 root
        self.flattenHelper(root)
        
    def flattenHelper(self,root):
        if not root.left and not root.right:
            return root 
        left,right=root.left, root.right
        end=root 
        if left:
            root.left=None
            root.right=left
            end=self.flattenHelper(left)
            #print end.val
        if right:
            end.right=right
            end=self.flattenHelper(right)
            #print end.val
            
        return end 
        
最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

推荐阅读更多精彩内容