Question: What is the time complexity of traversing a binary tree with n nodes?

Options:

1. O(n)
2. O(log n)
3. O(n log n)
4. O(1)

Correct Answer: O(n)

Solution:

Traversing a binary tree requires visiting each node once, leading to a time complexity of O(n).