Your Codec object will be instantiated and called as such: Your encode and decode algorithms should be stateless. Do not use class member/global/static variables to store states.The height of the n-ary tree is less than or equal to 1000.The number of nodes in the tree is in the range.You do not necessarily need to follow the above suggested formats, there are many more different formats that work so please be creative and come up with different approaches yourself. Or you can follow LeetCode's level order traversal serialization format, where each group of children is separated by the null value.įor example, the above tree may be serialized as. Note that this is just an example, you do not necessarily need to follow this format. You just need to ensure that an N-ary tree can be serialized to a string and this string can be deserialized to the original tree structure.įor example, you may serialize the following 3-ary treeĪs 2 4]]. There is no restriction on how your serialization/deserialization algorithm should work. An N-ary tree is a rooted tree in which each node has no more than N children. 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.ĭesign an algorithm to serialize and deserialize an N-ary tree.
0 kommentar(er)
