Challenges in construction from inorder traversal

Let us determine if we can uniquely serialize and deserialize a tree using its inorder traversal sequence (as introduced in the previous lesson, serialize means writing the tree as a flat sequence and deserialize means rebuilding it from that sequence). We will start with a simple tree, try to serialize it into its inorder traversal sequence, and then try reconstructing the same tree using the inorder sequence.

Serialization