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
- Which algorithm is used to detect cycles in a directed graph?
- Which sorting algorithm is best suited for a nearly sorted array, exhibiting O(N) time complexity in its best case?
- Which algorithm finds the longest common subsequence (LCS) of two sequences?
- The time complexity of the best case for QuickSort is:
- Which of the following statements about Dijkstra’s algorithm is true?
- The Activity Selection Problem can be optimally solved using a greedy approach. What is the greedy choice typically made at each step?
- Which algorithm uses a “divide and conquer” strategy?
- Which of the following is true for a min-heap?
- A unique piece of information that is used in encryption.
- Which algorithm finds Minimum Spanning Tree in a weighted graph by adding edges in increasing order?
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)