Implement all 3 DFS traversals (inorder, preorder, postorder) both recursively and iteratively. For iterative: use explicit stack, explain the pattern. Then implement BFS (level order) using queue. For each traversal on tree [1,2,3,4,5,null,6]: show output. Bonus: Morris traversal (O(1) space inorder).
