Question
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 property?
More Data Structure Questions
- Which algorithm constructs a suffix tree in linear time?
- Which of the following represents the Preorder Traversal of the binary tree given below? A / \ B C / \ D E
- Which of the following is NOT a valid feature of IPv6 compared to IPv4?
- Time complexity of heap sort is:
- What is the maximum possible number of nodes in a binary tree of height 3 (where the root is considered to be at height 0)?
- Which heap property is correct?
- Which of the following is a key characteristic of an effective Management Information System (MIS)?
- In CI/CD pipelines, which of the following is NOT a key benefit of Continuous Integration (CI)?
- Which SQL command is used to remove only specific rows from a table while preserving the structure and other rows?
- Which of the following is the primary characteristic of Infrastructure as a Service (IaaS) in cloud computing?
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)