Serialize and Deserialize Binary Tree
01 · Problem
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.
02 · Examples
1
/ \
2 3
/ \
4 5root = [1,2,3,null,null,4,5]
[1,2,3,null,null,4,5]
The tree is serialized into a string representation and then deserialized back into the exact same tree structure.
root = []
[]
An empty tree serializes to an empty representation and deserializes back to null/None.
03 · Constraints
- 01The number of nodes in the tree is in the range [0, 104].
- 02-1000 <= Node.val <= 1000
04 · Optimal complexity
- Time
- O(n)
- Space
- O(n)
Practice it alone or rehearse it as an interview.
Practice Mode gives you an editor and test runs, nothing else. AI Interview Mode puts a voice interviewer on the other side, adds a clock, and ends with a scored summary of the round.