Preorder traversal

Preorder traversal is where a node is visited before its descendants.

• Parents always come before their children.
• Running time for a tree with $n$ nodes is $O(n)$.

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