Binary Tree
0% completed
Challenges in construction from postorder traversal
Let us determine if we can uniquely serialize and deserialize a tree using its postorder traversal sequence (as introduced earlier in this course, 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 postorder traversal sequence, and then try reconstructing the same tree using the postorder sequence.
Example Tree
Serialization
Liking the course? Check our discounted plans to continue learning.