0
点赞
收藏
分享

微信扫一扫

297. Serialize and Deserialize Binary Tree. Sol

书呆鱼 2022-02-12 阅读 31

懒得写了。。直接搬运一下官方答案

Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.

Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.

Clarification: The input/output format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.

Example 1:

Input: root = [1,2,3,null,null,4,5]
Output: [1,2,3,null,null,4,5]

Example 2:

Input: root = []
Output: []

Constraints:

  • The number of nodes in the tree is in the range [0, 104].
  • -1000 <= Node.val <= 1000
    # Deserialization 
    class Codec:
        # Serialization 
    
        def serialize(self, root):
            """ Encodes a tree to a single string.
            :type root: TreeNode
            :rtype: str
            """
            def rserialize(root, string):
                """ a recursive helper function for the serialize() function."""
                # check base case
                if root is None:
                    string += 'None,'
                else:
                    string += str(root.val) + ','
                    string = rserialize(root.left, string)
                    string = rserialize(root.right, string)
                return string
            
            return rserialize(root, '')
    
        def deserialize(self, data):
            """Decodes your encoded data to tree.
            :type data: str
            :rtype: TreeNode
            """
            def rdeserialize(l):
                """ a recursive helper function for deserialization."""
                if l[0] == 'None':
                    l.pop(0)
                    return None
                    
                root = TreeNode(l[0])
                l.pop(0)
                root.left = rdeserialize(l)
                root.right = rdeserialize(l)
                return root
    
            data_list = data.split(',')
            root = rdeserialize(data_list)
            return root
举报

相关推荐

0 条评论