Depth-First Search

how to traverse trees with preorder, inorder, and postorder, when to pick each one, and how to convert between recursive and iterative implementations