61序列化二叉树

题目描述

请实现两个函数，分别用来序列化和反序列化二叉树



根据前序遍历，序列化二叉树，遇到null 用特殊字符代替

# -*- 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):
        # write code here
        if root == None:
            return '#,'
        return str(root.val)+','+self.Serialize(root.left)+self.Serialize(root.right)
    def Deserialize(self, s):
        # write code here
        self.index+=1
        sl = s.split(',')
        curchar = sl[self.index]
        root = None
        if curchar != '#':
            root = TreeNode(int(curchar))
            root.left =self.Deserialize(s)
            root.right = self.Deserialize(s)
        return root