序列化二叉树 牛客网 剑指Offer

版权声明：版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/DarrenXf/article/details/82497230

序列化二叉树 牛客网 剑指Offer

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

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def Serialize(self,root):
        if root == None:
            return "#"
        stack = []
        serializeStr = ''
        while root or stack:
            while root:
                serializeStr +=str(root.val) + ','
                stack.append(root)
                root=root.left
            serializeStr += "#,"
            root = stack.pop()
            root = root.right
        serializeStr = serializeStr[:-1]
        return serializeStr
    
    def Deserialize(self, s):
        serialize = s.split(',')
        tree,sp = self.deserialize(serialize,0)
        return tree
    
    def deserialize(self,s,sp):
        if sp >=len(s) or s[sp] == '#':
            return None, sp+1
        node = TreeNode(int(s[sp]))
        sp += 1
        node.left,sp = self.deserialize(s,sp)
        node.right,sp = self.deserialize(s,sp)
        return node,sp