Postorder traversal

Postorder traversal is where a node is visited after its descendants.

• Running time for a tree with $n$ nodes is $O(n)$.

def postOrder(T, v):
	for each child w of v in T:
		postOrder(T, w)
	visit(v)