Question
What is the worst-case time to decrease a key in a binary min-heap?
More Data Structure Questions
- What is the worst-case time complexity of the QuickSort algorithm?
- How many structurally different binary trees can be formed with 4 unlabelled nodes?
- Priority Queue allows access to elements based on priority rather than order.
- In a circular queue implemented using an array of size n, with 'front' and 'rear' indices, which condition correctly indicates that the queue is completely...
- 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 of the following is the primary reason why polymorphism is useful in Object-Oriented Programming (OOP)?
- Quick Sort achieves its best-case time complexity of O(n log n) under which of the following pivot selection conditions?
- During AVL tree insertion, a node becomes unbalanced with a balance factor of +2, and its right child has a balance factor of -1. Which rotation restores t...
- Which feature of OOP allows hiding implementation details while showing only the necessary functionality?
- Max-Flow Min-Cut theorem states:
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)