Question
A max-heap contains n elements. Which operation has worst-case O(log
A max-heap contains n elements. Which operation has worst-case O(log
n)?
More Data Structure Questions
- Using the Master Theorem, what is the time complexity of the recurrence T(n) = 3T(n/2) + n²?
- Which of the following allows dynamic memory allocation?
- Given the following code snippet, which operation is performed on the binary tree to produce the output: 4, 2, 5, 1, 3 ? class Node { int data; ...
- Tarjan’s algorithm is used to find:
- Which of the following statements is true about ACID properties in database transactions?
- Which of the following correctly describes the primary difference between Cross-Site Request Forgery (CSRF) and Cross-Site Scripting (XSS)?
- KMP pattern matching avoids:
- Which SOLID principle emphasizes that a class should have only one reason to change?
- Using a stack-based algorithm to check balanced brackets, is the string '{[(])}' valid, and at which character does it first fail (if any)?
- A programmer is implementing a data analysis tool that frequently needs to append elements to a collection. If an array is used, what is a potential perfor...
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)