void postorderPrint(const Tree& T, const Position& v) {
PositionIterator children = T.children(v);
while (children.hasNext()) { // visit children
postorderPrint(T, children.next());
cout << " ";
}
cout << v.element(); // print element
}