剑指offer37：序列化二叉树

tan90du

于 2019-07-15 19:34:28 发布

阅读量153

点赞数

CC 4.0 BY-SA版权

分类专栏：剑指offer

本文链接：https://blog.youkuaiyun.com/jackie_o2o2/article/details/95986215

剑指offer 专栏收录该内容

12 篇文章

订阅专栏

博客介绍了树的序列化与反序列化方法。序列化时将树序列为字符串，采用递归的先序遍历，碰到空指针变为特殊字符$；反序列化时，直接按‘，’号分隔开。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

在这里插入图片描述
1.把树序列为字符串可以看成递归，先序遍历
2.碰到空指针变为特殊字符$
3.反序列化时，直接按照‘，’号分隔开

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    flag = -1
    def Serialize(self, root):
        s = ""
        s = self.recursionSerialize(root, s)
        return s
    def recursionSerialize(self, root, s):
        if root is None:
            s = '$,'
            return s
        s = str(root.val) + ','
        left = self.recursionSerialize(root.left, s)
        right = self.recursionSerialize(root.right, s)
        s += left + right
        return s
    def Deserialize(self, s):
        self.flag += 1
        l = s.split(',')
        if self.flag >= len(s):
            return None
        root = None
        if l[self.flag] != '$':
            root = TreeNode(int(l[self.flag]))
            root.left = self.Deserialize(s)
            root.right = self.Deserialize(s)
        return root