Question

A data analysis task requires repeatedly extracting the element with the highest priority from a collection. Which heap operation is used for this, and what is its typical time complexity?

A Insert, O(log n)
B Delete, O(1)
C Extract-Max, O(log n)
D Peek, O(n)
E Heapify, O(n)
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)