[LeetCode]Serialize and Deserialize Binary Tree | 书影博客

[LeetCode]Serialize and Deserialize 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.

For example, you may serialize the following tree

    1    / \   2   3      / \     4   5

as "[1,2,3,null,null,4,5]", just the same as how LeetCode OJ serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.

Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.

题目大意：

序列化是将数据结构或者对象转换成比特序列的过程，以便将其存入文件或者内存缓冲区，或者通过网络连接进行传输，以后在本机或者其他电脑环境重建。

设计一个算法序列化、反序列化一棵二叉树。对于算法的序列化/反序列化的实现方式没有限制。你只需要能够确保二叉树可以序列化成一个字符串，并且可以反序列化成原始树结构即可。

例如，你可以将题目描述中的例子序列化为："[1,2,3,null,null,4,5]"，与LeetCode OJ序列化一棵二叉树的方式相同。你不一定非要遵从这种格式，请勇于创新，并想出不同的方法来。

注意：不要使用类成员/全局/静态变量来存储状态。你的序列化与反序列化算法应当是无状态的。

Read full article from [LeetCode]Serialize and Deserialize Binary Tree | 书影博客