Register

Datastructres

1,689 views
5 5 votes
The number of distinct max heap are possible with keys 1, 2, 3, 4, 5 are ________.

2 Answers

0 0 votes

Ans is 8

Voting & Accepting an answer helps improve the community
← Previous · Resource AllocationNext → · Implementation of qu...
← Previous in category · MadeEasy Test Series...Next in category → · Implementation of qu...
Position:
Show:

Related questions

1 1 vote
1 1 answer
778
778 views
admin asked Sep 16, 2024
778 views
ISI2024-MCS-PCB (CS) | Question: 2
Let $k$ be a positive integer, and $n=2^{k}-1$. Let $X=\{1,2, \ldots, n\}$ be arranged as a min-heap stored in a complete binary tree, $T$.What can be the smallest possib...
2 2 votes
1 answers 1 answer
948
948 views
Thor-o-s asked Sep 1, 2022
948 views
Algorithm which uses Max heap to find i smallest elements
Can anyone please explain how to find “ i “ smallest elements from an array whose elements are distinctPlease use max heap to explain the working input : n distinct eleme...
0 0 votes
0 0 answers
566
566 views
soujanyareddy13 asked Apr 12, 2022
566 views
NIELIT 2022 April Scientist B | Section B | Question: 107
Consider a max heap, represented by the array: $40, 30, 20, 10, 15, 16, 17, 8, 4$. Now consider that a value $35$ is inserted into this heap. After insertion, the new hea...
1 1 vote
1 1 answer
4.4k
4.4k views
sripo asked Nov 15, 2018
4,438 views
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....