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
- A hash table of size 7 uses h(k) = k mod 7 with linear probing for collision resolution. Keys 10, 3, 17, and 5 are inserted in that order. At which index d...
- What will be the output of the following Java snippet? class A { public void display() { System.out.println("Class A"); }} class B ext...
- Which of the following scenarios violates Boyce-Codd Normal Form (BCNF) in a relational schema?
- Which testing type evaluates internal code logic and control flow?
- What is "rubber duck debugging"?
- Consider a code flow where a large dataset is stored in an array. If frequent insertions and deletions are required at arbitrary positions within the array...
- Which data structure is used internally by a programming language's runtime to implement function calls and recursion?
- Which of the following is NOT a valid feature of IPv6 compared to IPv4?
- Which of the following is NOT among the OWASP Top 10 Web Security Risks?
- Which of the following techniques is primarily used to address overfitting in machine learning models?
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)