Serialize And Deserialize A Given N-Ary Tree

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

You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself. 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]]. An N-ary tree is a rooted tree in which each node has no more than N children. There is no restriction on how your serialization/deserialization algorithm should work. Design an algorithm to serialize and deserialize an N-ary 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.ĭesign an algorithm to serialize and deserialize an N-ary tree. The task is to complete two function serialize which takes the root node of the tree as input and stores the tree into an array and deSerialize which deserializes the array to the original tree and returns the root of it.

Serialize And Deserialize A Given N-Ary Tree