Recent questions tagged binary-heap

Heaps are usually implemented using arrays.If an element is present at a known array index in a heap of size $N$, what is the time complexity to remove that element and r...

A max-heap is stored using $0$-based indexing as:$$[60, 30, 45, 15, 5, 10, 20]$$During the first iteration of heap sort:Swap the root with the last element. Reduce the he...

A min-heap is stored using $1$-based indexing as:$[2, 13, 7, 17, 14, 22, 8, 21]$After one $\texttt{DeleteMin}$ operation, what is the final heap array?$[7, 13, 8, 17, 14,...

The following max-heap is stored using $1$-based indexing:$[57, 53, 42, 48, 25, 34, 29, 18, 30, 25]$Insert $55$ into this max-heap. What is the final heap array?$[57, 55,...

Consider the following binary min-heap:Perform the following operations in order:$\text{DeleteMin}$ $\text{Insert 8}$ $\text{Insert 2}$ What is the final array representa...

A binary heap is stored in an array using $\textbf{1}$-based indexing. If a node is stored at location $i$ and it has two children, where is its left child stored?$\left\...

Let $n$ be an odd number greater than $100$. Consider a binary minheap with $n$ elements stored in an array $P$ whose index starts from $1$.Which of the following indices...

Consider a min heap containing $n$ elements represented as an array, where $n>100$ and $n$ is odd.Assuming $1$-based indexing, which of the following cannot be the index ...

Which of the following operations can be performed in $\mathrm{O}(\log n)$ time in a binary heap?Deleting the root elementInserting an elementBoth $\text{(A)}$ and $\text...

If the largest value in a max-heap is in the root node and the second-largest value is in the root's right child, what will be the number of positions where the fourth-la...

  If the largest value in a max-heap is in the root node and the second-largest value is in the root's right child, what will be the number of positions where the fourth...