Visits left subtree, then root, then right subtree. Produces sorted output for BSTs.
Call stack depth h — O(log n) balanced, O(n) skewed