Package g0201_0300.s0297_serialize_and_deserialize_binary_tree

Class Codec

java.lang.Object
g0201_0300.s0297_serialize_and_deserialize_binary_tree.Codec
public class Codec extends Object
297 - Serialize and Deserialize Binary Tree.<p>Hard</p> <p>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.</p> <p>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.</p> <p><strong>Clarification:</strong> The input/output format is the same as <em>how LeetCode serializes a binary tree</em>. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/09/15/serdeser.jpg" alt="" /></p> <p><strong>Input:</strong> root = [1,2,3,null,null,4,5]</p> <p><strong>Output:</strong> [1,2,3,null,null,4,5]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> root = []</p> <p><strong>Output:</strong> []</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> root = [1]</p> <p><strong>Output:</strong> [1]</p> <p><strong>Example 4:</strong></p> <p><strong>Input:</strong> root = [1,2]</p> <p><strong>Output:</strong> [1,2]</p> <p><strong>Constraints:</strong></p> <ul> <li>The number of nodes in the tree is in the range <code>[0, 10<sup>4</sup>]</code>.</li> <li><code>-1000 <= Node.val <= 1000</code></li> </ul>