刷题记录：二叉树的序列化和反序列化

链接: 剑指 Offer II 048. 序列化与反序列化二叉树.

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

class Codec:

    def serialize(self, root):
        """Encodes a tree to a single string.
        
        :type root: TreeNode
        :rtype: str
        """
        if not root:
            return '#,'
        res = str()
        res += str(root.val)+","
        res+=str(self.serialize(root.left))
        res+=str(self.serialize(root.right))
        return res
        
    def deserialize(self, data):
        """Decodes your encoded data to tree.
        
        :type data: str
        :rtype: TreeNode
        """
        print(data)
        tmp = list(data.split(","))
        tmp = tmp[0:-1]
        tmp = tmp[::-1]
        return self.reconPreOrder(tmp)
    
    def reconPreOrder(self, data_ls):
        value = data_ls.pop()
        if value == "#":
            return None
        head = TreeNode(value)
        head.left = self.reconPreOrder(data_ls)
        head.right = self.reconPreOrder(data_ls)

        return head