LintCode 7. Binary Tree Serialization

题目

思路

序列化：层次遍历
反序列化：层次遍历，遍历的同时生成树。

代码

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


class Solution:
    """
    @param root: An object of TreeNode, denote the root of the binary tree.
    This method will be invoked first, you should design your own algorithm 
    to serialize a binary tree which denote by a root node to a string which
    can be easily deserialized by your own "deserialize" method later.
    """
    def serialize(self, root):
        # write your code here
        queue = []
        res_list = []
        if root:
            queue.append(root)
        while queue:
            root = queue[0]
            queue.pop(0)
            if root == '#':
                res_list.append('#')
            else:
                res_list.append(root.val)
                if root.left:
                    queue.append(root.left)
                else:
                    queue.append('#')
                if root.right:
                    queue.append(root.right)
                else:
                    queue.append('#')
        return res_list

    """
    @param data: A string serialized by your serialize method.
    This method will be invoked second, the argument data is what exactly
    you serialized at method "serialize", that means the data is not given by
    system, it's given by your own serialize method. So the format of data is
    designed by yourself, and deserialize it here as you serialize it in 
    "serialize" method.
    """
    def deserialize(self, data):
        # write your code here
        queue = []
        if not data:
            return None
        index = 0
        node = TreeNode(data[index])
        index += 1
        head = node
        queue.append(node)
        while index < len(data):
            root = queue[0]
            queue.pop(0)
            if data[index] == '#':
                root.left == None
            else:
                node = TreeNode(data[index])
                root.left = node
                queue.append(node)
            index += 1
            if data[index] == '#':
                root.right == None
            else:
                node = TreeNode(data[index])
                root.right = node
                queue.append(node)
            index += 1
        return head