MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Empty Set

A descending ...

Question

A descending heap is also called

A

Max heap

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

Min heap

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

Priority heap

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

Priority ordered tree

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A Max heap
A descending heap is also called max heap.

A Max heap is a complete binary tree 'H' with n elements, if each node 'N' of H is greater than equal to the children of 'N' is known as Max Heap. It is also known as Descending Heap.

Suggest Corrections

thumbs-up

0

Similar questions

Consider the binary min heap given below : (min heap is a binary tree where each node in a tree has a key which is less than or equal to the key of its children) Insert the key 1 in above min heap which of the following is the resulant min heap after two delete operations ?

Q. A priority queue is implemented as a max-heap initially, it has five elements. The level-order traversal of the heap is as follows:
20, 18, 15, 13, 12
Two new elements '10' and '17' are inserted in the heap in that order, The level-order traversal of the heap after the insertion of the element is

Q. The descending aestivation is also called

Q. Sort the following values is descending order.

Q. Which of the following is the correct order of age in descending order ?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Empty Sets

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Standard X Mathematics

Join BYJU'S Learning Program

CrossIcon