Answer – C
In a max heap, the largest element is at the root, and each parent node is greater than or equal to its child nodes. Therefore, the 10th largest element in a max heap will be the 10th element when the heap is traversed in descending order.
The time complexity to find the 10th largest element in a max heap is Θ(1). This is because you can directly access the element at the 10th position in the heap without traversing the entire heap or performing any additional operations.
So, the correct option is: Θ(1)