python--lintcode453. 将二叉树拆成链表

              1
               \
     1          2
    / \          \
   2   5    =>    3
  / \   \          \
 3   4   6          4
                     \
                      5
                       \
                        6

这一题简单粗暴的方法就是用一个list保存所有结点：

class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None


class Solution:
    """
       @param root: a TreeNode, the root of the binary tree
       @return: nothing
       """

    def flatten(self, root):
        list=[]
        def traverse(root):
            if(root is None):return
            list.append(root)
            traverse(root.left)
            traverse(root.right)
        traverse(root)
        if(len(list)>1):
            for i in list:
                root.left=None
                root.right=i
                root=root.right



a=Tree = TreeNode(1)
# b=Tree.left = TreeNode(2)
# c=Tree.right = TreeNode(3)
# d=b.left=TreeNode(4)
s = Solution()
s.flatten(a)
print(a.right.val)
# print(s.flatten(a))