DFS traversals: Inorder (left, root, right) - BST gives sorted order, Preorder (root, left, right) - copy tree, serialize, Postorder (left, right, root) - delete tree, evaluate expressions. BFS: Level order using queue - level-by-level processing. Iterative versions use explicit stack. Time: O(n) for all.