Question: What is the time complexity of merging two sorted binary trees?

Options:

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

Correct Answer: O(n)

Solution:

Merging two sorted binary trees involves visiting each node, resulting in a time complexity of O(n), where n is the total number of nodes.