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.
Input: root = [1,2,3,null,null,4,5] Output: [1,2,3,null,null,4,5]
Input: root =  Output: 
- The number of nodes in the tree is in the range
-1000 <= Node.val <= 1000
# 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): def ser(root): if root: vals.append(str(root.val)) ser(root.left) ser(root.right) else: vals.append('null') vals =  ser(root) return ' '.join(vals) def deserialize(self, data): def des(): v = next(vals) if v=='null':return None x = TreeNode(int(v)) x.left = des() x.right = des() return x vals = iter(data.split()) return des() # Your Codec object will be instantiated and called as such: # codec = Codec() # codec.deserialize(codec.serialize(root))