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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
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
Number of Max Heap
+1
vote
339
views
How many maxheaps can be formed with the following elements?
$\{1,1,1,2,2,2,3,3,3,4,4,4\}$
datastructure
permutationsandcombinations
binaryheap
heap
asked
Jun 4, 2018
in
DS
by
Balaji Jegan
Active
(
4.8k
points)
edited
Jun 24, 2018
by
Anu007

339
views
answer
comment
0
Answer 2112??
0
I don't know the answer since it is a self doubt question. :(
+3
Do you always selfproclaim your self doubts "Mind blowing" "mind boggling" "OMG! What an interesting Question" ??
+2
@Balaji Please use proper title. This is not a place for advertisement.
0
is there any fast procedure for finding the answer?
0
how?
0
@
srestha
Could you please give your explanation ?
Your identity must be verified before you can post a comment. Please wait if already uploaded identity proof or upload your proof
here
Please
log in
or
register
to answer this question.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
0
votes
0
answers
1
Max heap when stored in an array is always in sorted order
This question is in CLRS,if we have a max heap it is always in sorted order(descending) order.And by extension if we have min heap the array is sorted in ascending order.Is this true? I have a counter example for ... it an heapified representation or not? If we heapify after deletion and store max deleted element then we get sorted array.
asked
Nov 15, 2018
in
DS
by
sripo
Active
(
1.5k
points)

129
views
sorting
binaryheap
arrays
heap
datastructure
algorithms
+1
vote
2
answers
2
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)

415
views
heap
binaryheap
datastructure
0
votes
0
answers
3
Madeeasy Max Heap 2019
Please explain the logic behind this shortcut and when to be used?
asked
Jan 13
in
Algorithms
by
Markzuck
Junior
(
633
points)

205
views
heap
datastructure
binaryheap
algorithms
madeeasytestseries
0
votes
1
answer
4
#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, 2018
in
DS
by
iarnav
Loyal
(
9.6k
points)

94
views
binaryheap
heap
+3
votes
1
answer
5
Binary Max Heap
In a binary max heap containing n numbers, the smallest element can be found in time?
asked
Sep 13, 2016
in
DS
by
Hardik Vagadia
(
495
points)

432
views
binaryheap
heap
+1
vote
1
answer
6
Deleting a random node from Heap
What is the time complexity of 'deleting any random node from a max or min heap'?
asked
Dec 21, 2018
in
DS
by
Avijit Shaw
(
135
points)

110
views
heap
binaryheap
timecomplexity
datastructure
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, 2018
in
DS
by
iarnav
Loyal
(
9.6k
points)

103
views
algorithms
binaryheap
heap
datastructure
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
Important Dates for Counselling (GATE 2019)
IIT Gandhinagar review
AIR175 : GO is enough
GATE 2019 My reasoned routine. (AIR 558)
if i can you also can
All categories
General Aptitude
1.6k
Engineering Mathematics
7.3k
Digital Logic
2.7k
Programming & DS
4.9k
Programming
3.6k
DS
1.3k
Algorithms
4.2k
Theory of Computation
5.4k
Compiler Design
2.1k
Operating System
4.2k
Databases
4k
CO & Architecture
3.5k
Computer Networks
4.2k
Non GATE
1.4k
Others
1.5k
Admissions
570
Exam Queries
566
Tier 1 Placement Questions
23
Job Queries
70
Projects
18
Follow @csegate
Recent Blog Comments
not yet..
Has IIT Hyderabad admission opened? Not able to...
Congratulations on your achievement. Can you...
It's nice one. Not that technically difficult...
48,725
questions
52,831
answers
183,520
comments
68,657
users