LeetCode刷题20--二叉树的序列化与反序列化

297. 二叉树的序列化与反序列化

链接

题目描述

序列化是将一个数据结构或者对象转换为连续的比特位的操作，进而可以将转换后的数据存储在一个文件或者内存中，同时也可以通过网络传输到另一个计算机环境，采取相反方式重构得到原数据。

请设计一个算法来实现二叉树的序列化与反序列化。这里不限定你的序列 / 反序列化算法执行逻辑，你只需要保证一个二叉树可以被序列化为一个字符串并且将这个字符串反序列化为原始的树结构。

代码

前序遍历

# 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
        """
        str_1=""
        if root==None:
            str_1+="None,"
            return str_1
        str_1+=str(root.val)+","
        str_1+=self.serialize(root.left)
        str_1+=self.serialize(root.right)
        return str_1        

    def deserialize(self, data):
        """Decodes your encoded data to tree.
        
        :type data: str
        :rtype: TreeNode
        """
        def helper(nodes):
            if nodes[0]=="None":
                nodes.pop(0)
                return None
            root=TreeNode(nodes[0])
            nodes.pop(0)
            root.left=helper(nodes)
            root.right=helper(nodes)
            return root
        return helper(data.split(","))

后序遍历

# 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
        """
        str_1=""
        if root==None:
            str_1+="None,"
            return str_1
        str_1+=self.serialize(root.left)
        str_1+=self.serialize(root.right)
        str_1+=str(root.val)+","
        return str_1
        
    def deserialize(self, data):
        """Decodes your encoded data to tree.
        
        :type data: str
        :rtype: TreeNode
        """
        def helper(nodes):
            
            if nodes[-1]=="None":
                nodes.pop()
                return None
            root=TreeNode(nodes[-1])
            
            nodes.pop()
            
            root.right=helper(nodes)
            root.left=helper(nodes)
            return root
        
        return helper(data.split(",")[:-1])