Input: Post order Tree Traversal data, Output: Tree

• Last one (E) becomes the root

• Some immediate (backward) right ones ones (L A T) up until middle (you can choose)  also becomes parents (downward right side parent)

• – Then put some immediate ones (backward) ( N F ) as left  children to come to root

Then take alternate (K P) to have the parents on the left side of the tree

• Come back from the last, with the remaining ones (G D)

• and make right children (left sub tree)