Answer
Showing that an ordered rooted tree is uniquely determined
when a list of vertices generated by a postorder traversal
of the tree and the number of children of each vertex are
specified.
Work Step by Step
--Use mathematical induction.
-The result is trivial for a list with one element.
Assume the result is true for a list with n elements.
--For the inductive step, start at the end.
Find the sequence of vertices at the end of the list starting with the
last leaf, ending with the root, each vertex being the last child
of the one following it.
- Remove this leaf and apply the inductive hypothesis.
