Python, LintCode, 453. 将二叉树拆成链表

"""
Definition of TreeNode:
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):
        # write your code here
        if root == None:
            return None
        nodelist = []
        nodelist.append(root)
        while len(nodelist) != 0:
            node = nodelist.pop()
            if node.right:
                nodelist.append(node.right)
            if node.left:
                nodelist.append(node.left)
            if len(nodelist) != 0:
                node.left = None
                node.right = nodelist[-1]
        return root