Register

Recent questions tagged binary-heap

0 votes
1 answer
241
This question is from CLRS (12.1-3).
What is the difference between the binary-search-tree property and the min-heap property? Can the min-heap property be used to print out the keys of an n-node tree in sorted order in O(n) time?
What is the difference between the binary-search-tree property and the min-heap property? Can the min-heap property be used to print out the keys of an n-node tree in sor...
User Avatar
8 votes
3 answers
242
7th smallest element in a Min-Heap
In a min-heap with n elements 1). The 7th smallest element can be found in time, if duplicates are allowed ? 2). The 7th distinct smallest element can be found in time, If duplicates are allowed ?
In a min-heap with n elements1). The 7th smallest element can be found in time, if duplicates are allowed ?2). The 7th distinct smallest element can be found in time, I...
User Avatar
0 votes
2 answers
243
build heap
how to merge two binary max heaps ? size of first heap is m+n and size of second heap is n and also find the complexity.
how to merge two binary max heaps ?size of first heap is m+n and size of second heap is nand also find the complexity.
User Avatar
2 votes
2 answers
244
Heap IMP
A max heap stores unique digits from 1 to 100 in an array.(total 100 elements) What is the maximum possible index number for element 92 ?
A max heap stores unique digits from 1 to 100 in an array.(total 100 elements)What is the maximum possible index number for element 92 ?
User Avatar
1 votes
2 answers
246
practice questions
the time required to find 7th smallest element in min heap of size n vertices? solve and plz explain how?
the time required to find 7th smallest element in min heap of size n vertices? solve and plz explain how?
User Avatar
3 votes
2 answers
247
UGC NET CSE | Junet 2015 | Part 3 | Question: 36
The number of nodes in height h in any n-element heap is $h$ $z^h$ ceil $\biggl(\frac{n}{z^h} \biggr)$ ceil $\biggl(\frac{n}{z^{h+1}} \biggr)$
The number of nodes in height h in any n-element heap is$h$$z^h$ceil $\biggl(\frac{n}{z^h} \biggr)$ceil $\biggl(\frac{n}{z^{h+1}} \biggr)$
User Avatar
1 votes
1 answer
248
heap sort
The number of elements that can be sorted in time using heap sort ?
The number of elements that can be sorted in time using heap sort ?
User Avatar
1 votes
2 answers
249
Self Made
Given an unsorted Array of n elements and asked to find the Largest element of that array. Can we use Max-Heapify Procedure to find the Largest element in that array in O(logn) time ?
Given an unsorted Array of n elements and asked to find the Largest element of that array. Can we use Max-Heapify Procedure to find the Largest element in that array in O...
User Avatar
14 votes
2 answers
252
ISI2014-PCB-CS-2b
Let $H_1$ and $H_2$ be two complete binary trees that are heaps as well. Assume $H_1$ and $H_2$ are max-heaps, each of size $n$. Design and analyze an efficient algorithm to merge $H_1$ and $H_2$ to a new max-heap $H$ of size $2n$.
Let $H_1$ and $H_2$ be two complete binary trees that are heaps as well. Assume $H_1$ and $H_2$ are max-heaps, each of size $n$. Design and analyze an efficient algorithm...
User Avatar
0 votes
1 answer
253
introduction to algorithm 6.2.3 exercise question
$6.2-3$ What is the effect of calling MAX-HEAPIFY(A,i) when the element A[i] is larger that its children?
$6.2-3$What is the effect of calling MAX-HEAPIFY(A,i) when the element A[i] is larger that its children?
User Avatar
1 votes
1 answer
258
Heap Sort best case
What is the Best Case run time of Heap Sort ? A. $O(1)$ B. $O(n)$ C. $O(n \log n)$ D. $O(\log n)$
What is the Best Case run time of Heap Sort ?A. $O(1)$B. $O(n)$C. $O(n \log n)$D. $O(\log n)$
User Avatar
0 votes
1 answer
261
Is it possible to delete intermediate node/number in Heap?
Is it possible to delete intermediate node/number in Heap? Not a root or last.
Is it possible to delete intermediate node/number in Heap? Not a root or last.
User Avatar
0 votes
3 answers
264
How does huffman encoding involve the concept of build-heap algorithm ?
Though the parent node is maximum of both the child nodes but still the procedure we follow is chosing the minimum at each step and adding them to produce a parent node, so how come heapify procedure is called here ?
Though the parent node is maximum of both the child nodes but still the procedure we follow is chosing the minimum at each step and adding them to produce a parent node, ...
User Avatar
32 votes
4 answers
265
GATE CSE 2015 Set 3 | Question: 19
Consider the following array of elements. $\langle 89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100 \rangle$ The minimum number of interchanges needed to convert it into a max-heap is $4$ $5$ $2$ $3$
Consider the following array of elements.$\langle 89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100 \rangle$The minimum number of interchanges needed to convert it into a ma...
User Avatar
28 votes
1 answer
266
GATE CSE 2015 Set 1 | Question: 32
Consider a max heap, represented by the array: $40, 30, 20, 10, 15, 16, 17, 8, 4$ ... $40, 30, 20, 10, 35, 16, 17, 8, 4, 15$ $40, 35, 20, 10, 15, 16, 17, 8, 4, 30$
Consider a max heap, represented by the array: $40, 30, 20, 10, 15, 16, 17, 8, 4$.$$\begin{array}{|l|l|}\hline \text{Array index} & \text{1} & \text{2} & \text{3} & \...
User Avatar
62 votes
4 answers
267
GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is...
User Avatar
11 votes
5 answers
269
What is the complexity of finding 50th smallest element in an already constructed binary min-heap?
What is the complexity of finding $50^{th}$ smallest element in an already constructed binary min-heap? $\Theta(1)$ $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$
What is the complexity of finding $50^{th}$ smallest element in an already constructed binary min-heap?$\Theta(1)$$\Theta (\log n)$$\Theta (n)$$\Theta (n \log n)$
User Avatar
Page: