Question
Which data structure supports extraction of both min and max in O(1) time and insertion in O(log
Which data structure supports extraction of both min and max in O(1) time and insertion in O(log
n)?
More Algorithms Questions
- In which type of memory management does the operating system divide physical memory into fixed-size blocks?
- Which data structure is used in BFS (Breadth-First Search)?
- Which page replacement algorithm replaces the page that will not be used for the longest period of time in the future?
- In virtualization, what is the primary role of a hypervisor?
- Which command is used to undo the changes
- Converting binary number 110001 to decimal will result in:
- Which algorithm is used to detect cycles in a directed graph?
- Which graph traversal method uses a queue?
- Dynamic Programming is primarily an effective technique for solving problems that exhibit which two key properties?
- Which sorting algorithm is best suited for a nearly sorted array, exhibiting O(N) time complexity in its best case?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
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)