Visits root, then left subtree, then right subtree. Useful for creating a copy of the tree.
Call stack depth h — O(log n) balanced, O(n) skewed