GraphLab › Binary tree from traversals
A binary tree can be rebuilt from two of its traversals, as long as one of them is the in-order sequence.
With post-order + in-order it works the same way, but the root is the last value of the post-order sequence.
Insert values one by one: each value goes left if it is smaller than the current node and right if it is larger, until it finds an empty place.
Type the sequences, press Build and step through the construction. Then use Traverse to check the orders of the finished tree.