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 command is TCL command
- In a Min-Heap, the root node is:
- Recursive problems are implemented by
- Which of the following properties must a problem exhibit to be solvable by a greedy algorithm?
- What is the primary function of a firewall in network security?
- Which of the following is NOT one of the OWASP Top 10 web security risks?
- Which sorting algorithm is not stable by default?
- Converting binary number 110001 to decimal will result in:
- The recurrence relation T(n) = 2T(n/2) + O(n) corresponds to which algorithm’s time complexity?
- What is the worst-case time complexity of a linear search algorithm on an array of 'N' elements?
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)