Question: What is the time complexity of the inorder traversal of a binary tree?

Options:

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

Correct Answer: O(n)

Solution:

Inorder traversal visits each node exactly once, resulting in a time complexity of O(n), where n is the number of nodes in the tree.