【二叉树】序列化二叉树

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def __init__(self):
        self.index = -1
    def Serialize(self, root):
        if root == None:
            return '#,'
        else:
            return str(root.val) + ',' + self.Serialize(root.left) + self.Serialize(root.right)
    def Deserialize(self, s):
        L = s.split(',')
        self.index += 1
        if self.index >= len(s) or L[self.index] == '#':
            return None
        node = TreeNode(int(L[self.index]))
        node.left = self.Deserialize(s)
        node.right = self.Deserialize(s)
        return node