Serialize and Deserialize Binary Tree
Hard
Tree
Depth-First Search
Breadth-First Search
Design
String
Binary Tree
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. Implement `serialize(root)`, which encodes a tree to a single string, and `deserialize(data)`, which decodes the encoded string back to the original tree.
Example 1
Input: root = [1,2,3,null,null,4,5]
Output: [1,2,3,null,null,4,5]
Example 2
Input: root = []
Output: []
Example 3
Input: root = [1]
Output: [1]

Constraints

  • The number of nodes in the tree is in the range [0, 10⁴].
  • -1000 <= Node.val <= 1000
Time Complexity
O(n)
Space Complexity
O(n)
14
Case 1
Input: [1,2,3,null,null,4,5]
Expected: [1,2,3,null,null,4,5]
Case 2
Input: []
Expected: []
Case 3
Input: [1]
Expected: [1]