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
- In an unweighted graph with edges A-B, A-C, B-D, B-E, C-F, and D-G, how many nodes are at a shortest-path distance of exactly 2 from node A (as found via B...
- Which of the following is a core characteristic of Big Data?
- Time complexity of heap sort is:
- Which feature of OOP allows hiding implementation details while showing only the necessary functionality?
- How many structurally distinct binary trees can be formed with 4 nodes?
- Consider the following sequence of stack operations: PUSH(10) → PUSH(20) → PUSH(30) → POP() → PUSH(40) → POP() → POP() What is the final state of the sta...
- A stack has 1,2,3 with 3 on top. pop, push 4, pop, push 5, pop. Final returned value?
- How many distinct spanning trees does the complete labelled graph K5 have?
- In asymmetric encryption, which of the following statements is correct?
- What is the primary disadvantage of using a singly linked list compared to an array for random access (e.g., accessing the 50th element)?
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)