[UVA] 10701 - Pre, in and post
Problem F - Pre, in and post
Time Limit: 1 second
A common problem in data structures is to determine the traversal of
a binary tree. There are three classic ways to do it:
Pre-order: You must visit in
sequence the root, left subtree and the right subtree.
In-orde...
