binary tree traversal left to right leaves to root

[chickenandfries]

Is there an algorithm that traverses a tree left to right from the leaves to the root? It's like reverse level order traversal but instead of right to left the traversal would be left to right. If there is no such algorithm, I would appreciate any suggestion, at least an outline or a pseudocode, of how I could do that. An algorithm of reverse level order traversal might help and would be greatly appreciated too.

[CMPITG]

You should use postorder traversal:
visit(u):
for each v in Child(u):
visit(v)
print u

[chickenandfries]

Thanks. Didn't think it was that simple.

[CMPITG]

You're welcome :D