Question
What is the tight asymptotic time complexity of building a binary min-heap from an unsorted array of n elements using the standard bottom-up heapify approach?
More Data Structure Questions
- In the context of system analysis, which of the following best defines the "use case" diagram?
- A circular queue is implemented in an array of size 8 (indices 0 to 7). The front index is 5 and the rear index (pointing to the last inserted element) is ...
- A max-heap contains n elements. Which operation has worst-case O(log n)?
- What is the postorder traversal of the BST built by inserting 50, 30, 70, 20, 40, 60, 80, 10 in this order?
- Using Kruskal's algorithm on a graph with edges A-B(1), B-C(3), A-C(4), C-D(2), B-D(5), what is the total weight of the Minimum Spanning Tree?
- Which testing type evaluates internal code logic and control flow?
- Which of the following best illustrates Encapsulation in Object-Oriented Programming?
- In the context of asymmetric encryption, which of the following is a key feature of public-private key pairs?
- Consider the following stack operations. What will be the content of the stack after executing all the operations? Stack stack = new Stack <>(); stac...
- A min-heap contains n distinct elements. An arbitrary element at a known index is decreased in value. What is the worst-case time to restore the heap prope...
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)