The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged binaryheap
Slides
0
votes
0
answers
1
Max heap when stored in an array is always in sorted order
asked
2 days
ago
in
DS
by
sripo
Junior
(
733
points)

35
views
sorting
binaryheap
arrays
heap
datastructure
algorithms
0
votes
1
answer
2
How to understand difference between n/2 and log(n) when comes to operations on a binary tree
asked
Nov 8
in
DS
by
sripo
Junior
(
733
points)

44
views
datastructure
binarytree
heap
binaryheap
0
votes
0
answers
3
Advance test algorithms
what i did {$2^{h+1}1=100$} so i found h=6 so max swaps needed would be 6 please check it or tell me if i iam wrong
asked
Oct 23
in
Programming
by
Prince Sindhiya
Active
(
4.3k
points)

43
views
algorithms
binaryheap
0
votes
0
answers
4
No. of comparison in min heap
What is the number of comparisons required to extract 45th element of the min heap?
asked
Sep 10
in
Algorithms
by
bts1jimin
(
101
points)

89
views
algorithms
heap
binaryheap
timecomplexity
0
votes
1
answer
5
#binary heap
asked
Aug 29
in
Programming
by
Shubham Aggarwal
Active
(
1.2k
points)

22
views
binaryheap
0
votes
0
answers
6
Heap Sorting
Consider a binary tree, where left and right subtreealready heapified. But we havenot done heapificationfor root yet. Then what is time complexity to convert it in a full heap tree? $A)O(\log n)$ or $o(n)$ $B)\Omega (\log n)$ or $\omega(n)$ $C)\Theta (\log n)$ or $\theta (n)$ $D)\text{None of these}$
asked
Aug 18
in
DS
by
srestha
Veteran
(
101k
points)

119
views
algorithms
sorting
heap
binaryheap
timecomplexity
0
votes
0
answers
7
#DS Inserting elements into Min Heap?
The number of distinct min heap are possible with keys 1, 2, 3, 4, 5 are ________. I know, there are variance of this question for Max heap and even for Min heap, the answer won't change, but I just wanna know if my technique is right or not. ===== ... any value. > Lastly the right sub tree => 1C1 = 1 Totally  1*4C3*1*2*1 = 8. Is this approach correct?
asked
Jun 24
in
DS
by
iarnav
Loyal
(
9k
points)

80
views
algorithms
binaryheap
heap
datastructure
0
votes
0
answers
8
#DS Min Heaps Possible?
The number of possible minheaps containing each value from {1,1,1,1,1,1,1} exactly once is _______ This is a variance of Gate 2018 question and how will we deal if all values are same?
asked
Jun 24
in
DS
by
iarnav
Loyal
(
9k
points)

49
views
algorithms
binaryheap
datastructure
+2
votes
1
answer
9
Heap DS
A min heap having 1024 distinct elements with keys ranging from 0 to 1023 is stored in array of 1024 indices. The maximum difference between element 512 present at maximum level and minimum level is ________. [Assume root is ... taking maximum level 11 and minimum level 2 __________________________________________________________________________ why minimum level 2, and why it is not 1?
asked
Jun 24
in
Programming
by
srestha
Veteran
(
101k
points)

148
views
heap
algorithms
binaryheap
datastructure
0
votes
1
answer
10
#Algorithms Can Heapsort be applied on Min Heap Data Structure?
asked
Jun 20
in
Algorithms
by
iarnav
Loyal
(
9k
points)

44
views
heap
algorithms
binaryheap
0
votes
1
answer
11
#Binary Max Heap Question (Doubt)
Let's say we're given with a MAX Heap and we want to delete any of the leaf node, then how much time will it take to delete any of the leaf node and maintain the max heap property? My main doubt is  will it O(n) time to reach to leaf nodes?
asked
Jun 19
in
DS
by
iarnav
Loyal
(
9k
points)

80
views
binaryheap
heap
0
votes
0
answers
12
Number of Max Heap
How many maxheaps can be formed with the following elements? $\{1,1,1,2,2,2,3,3,3,4,4,4\}$
asked
Jun 4
in
DS
by
Balaji Jegan
Active
(
3.1k
points)

211
views
datastructure
permutationsandcombinations
binaryheap
heap
0
votes
1
answer
13
Dijkstra Time Complexity using Binary Heap
asked
May 22
in
Algorithms
by
iarnav
Loyal
(
9k
points)

98
views
algorithms
binaryheap
dijkstrasalgorithm
timecomplexity
heap
0
votes
0
answers
14
Heap DataStructure
A min heap having $1024$ distinct elements with keys ranging from $0$ to $1023$ is stored in array of $1024$ indices. The maximum difference between $(n/2)^{th}$ element present at maximum level and minimum level is ________. [Assume root is present at $level1$] ? Please Tell me the Approach
asked
May 20
in
Algorithms
by
Na462
Loyal
(
6.9k
points)

46
views
algorithms
binaryheap
0
votes
1
answer
15
Doubt on Heap
How much time will it take for deleting $i^{th}$ and a number $n(random)$ node from a heap ?
asked
Apr 28
in
Algorithms
by
Akash Kumar Roy
(
493
points)

70
views
algorithms
binaryheap
0
votes
1
answer
16
Fibnocii heap
what is Potential function in Fibonacci heap (i dont remember the question ) plz explain with example
asked
Mar 30
in
Algorithms
by
akshat sharma
Active
(
1.7k
points)

69
views
heap
algorithms
binaryheap
0
votes
0
answers
17
Heap Smallest Element
My question is in Question like find 5th Smallest element in a heap: It requires O(logn) time if we do only Delete operation 5 Times.But what if the array contains no 5th smallest element say our array contain [1,1,1,1,1,1,1,1,1,1] now ... need to do extract min operation n number of times which would give nlogn time? Plz Clear my doubt https://gateoverflow.in/1110/gate200323
asked
Feb 17
in
Algorithms
by
Na462
Loyal
(
6.9k
points)

118
views
heap
binaryheap
algorithms
+5
votes
2
answers
18
Max Heap Counting
MY SOLUTION : Fix the root then next level 2 elements ( 2! possibilities) next level 4 elements( 4! possibilities) last level 2 elements ( 2! possibilities) total possibility = 2! * 4! * 2! = 2 * 24 * 2 = 96 what went wrong ? just in case if the ... ,1,7,9 such that if node of above graph is filled with these elements it satisfies max heap property a)96 b)896 c)2688 d) none
asked
Jan 24
in
DS
by
A_i_$_h
Boss
(
12.5k
points)

387
views
madeeasytestseries
max
binaryheap
+3
votes
2
answers
19
Datastructres
The number of distinct max heap are possible with keys 1, 2, 3, 4, 5 are ________.
asked
Jan 20
in
DS
by
MIRIYALA JEEVAN KUMA
Active
(
2.3k
points)

191
views
binaryheap
heap
algorithms
datastructure
+4
votes
1
answer
20
Max heap no. of interchange required
asked
Jan 7
in
DS
by
Lakshman Patel RJIT
Boss
(
14.2k
points)

126
views
datastructure
binaryheap
+1
vote
2
answers
21
Max Heap
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.
asked
Nov 7, 2017
in
DS
by
shivangi5
Active
(
1.4k
points)

341
views
heap
binaryheap
datastructure
+5
votes
2
answers
22
Min Heap
In a minheap, the next largest element of a particular element can be found in ___ time. A) O(1) B) O(log n) C) O(n)
asked
Oct 31, 2017
in
Algorithms
by
Shivam Chauhan
Loyal
(
8.9k
points)

343
views
heap
algorithms
binaryheap
timecomplexity
0
votes
0
answers
23
Data Structure: Find 7th smallest element in Min heap
asked
Oct 18, 2017
in
Programming
by
Shubhanshu
Boss
(
16.2k
points)

320
views
heap
binaryheap
timecomplexity
algorithms
0
votes
1
answer
24
cormen page 157159
While proving that the running time of the BUILDMAXHEAP to be O(n) and not O(n lgn), the have considered the number of nodes or elements at some height 'h' to be n/2^(h+1). How? All I know is that 2^h alone can give you number of nodes at some heigh h. I do not understand this. Can someone explain in detail?
asked
Sep 10, 2017
in
Algorithms
by
Warlock lord
Active
(
3.4k
points)

57
views
algorithms
binaryheap
+2
votes
0
answers
25
CLRS Heapsort, number of nodes of height h ?
asked
Jul 5, 2017
in
Programming
by
bhuv
Active
(
4k
points)

111
views
algorithms
binaryheap
+1
vote
2
answers
26
binary heap
Consider a binary min heap containing n elements and every node is having degree 2 ( i.e. full binary min heap tree). What is the probability of finding the largest element at the last level ? According to my understanding the largest elemenyt has to be a leaf and since leafs can be on two levels last and second last therefore the probability should be 1/2
asked
Jan 15, 2017
in
Algorithms
by
Pankaj Joshi
Active
(
3k
points)

242
views
heap
binaryheap
algorithms
geekmock2017
+7
votes
2
answers
27
Max Heap
The number of ways , in which numbers 1,2,3,4,5 can be inserted into binary heap,such that resultant binary heap is max heap ? given ans :8
asked
Dec 9, 2016
in
Programming
by
minal
Boss
(
15.8k
points)

980
views
heap
binaryheap
algorithms
Page:
1
2
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Basic LaTeX guide
IIT Madras Phd
Databases GO Classroom
Happy Birthday Sir Arjun
NIELIT EXAM DATE 2018
Follow @csegate
Gatecse
Recent questions tagged binaryheap
Recent Blog Comments
Sir for final year student who have exam in...
I guess you meant while chasing :) Anyway those...
I'll write a post on how to best...
@Gaurav Go through all the previous yr questions,...
42,513
questions
48,529
answers
155,004
comments
63,364
users