Question: What is the time complexity of deleting a node in a Red-Black tree?

Options:

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

Correct Answer: O(log n)

Solution:

The time complexity of deleting a node in a Red-Black tree is O(log n) due to the balancing operations.