CameraIcon

SearchIcon

MyQuestionIcon

1

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

Empty Set

Consider the ...

Question

$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 ?$

A

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

B

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

C

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

D

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

Open in App

Solution

The correct option is D
$W h e n w e i n s e r t 1 i n t h e h e a p$

$F o r d e l e t i n g 1.1 i s e x c h a n g e d w i t h l a s t e l e m e n t o f m i n h e a p .$

$N o w w e h a v e t o m a i n t a i n t h e m i n h e a p p r o p e r t y . A f t e r b a l a n c i n g t h e m i n h e a p i t b e c o m e$

$T h i s i s t h e r e s u l tan t h e a p s o c o r r e c t a n s w e r i s o p t i o n (a) .$

Suggest Corrections

thumbs-up

0

Similar questions

Q. A binary min heap consisting of integers is implemented using array A[l ....n] in which root node is stored at A[1] and locations A[l] through A[n] store the 'n' integer values in the heap. The minimum number of comparisons required to find maximum element in a min heap of 99 elements is

T h e t i m e c o m p l e x i t y t o d e l e t e a n e l e m e n t a t

i n d e x^{'} K^{'} (K \leq n) i n a m i n - h e a p o f s i z e n i s

Q. Which one of the following array represents a binary max-heap?

Q. A d-ary heap is like a binary heap, but instead of two children, nodes have 'd' children. A d-ary heap can be represented in a 1-dimensional array as follows. The root is kept in A[1], its d children are kept in order in A[2] through A[d + 1] their children are kept in order in A[d + 2] through

A [d^{2} + d + 1]

and so on. What index does maps the

j^{t h}

(1 \leq J \leq d)

i^{t h}

Q. Consider the following statements :

S_{1}

: While program in execution, access to heap memory is slower as compared to accessing variables allocated on stack.

S_{2}

: While program in execution, in a multithread situation, each thread has its own stack and share a common heap memory.

S_{3}

: During a program execution, heap is stored in main memory and stack is present in secondary memory.
Which of the above is incorrect ?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Empty Set

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Standard VIII Mathematics

Join BYJU'S Learning Program

CrossIcon