* Time Complexity: O(n) - We visit every node exactly once. * Space Complexity: O(h) - Where h is the height of the tree (recursion stack). * O(n) for skewed, O(log n) for balanced.