edited by
1,518 views

7 Answers

7 votes
7 votes

all option are false

Option A is violated max heap property because 8 is greater than his root.
Option B  is violated max heap property because 8 is greater than his root.
Option C is violated max heap property because 7 is greater than his root.
Option D is violated max heap property because 9,10,8,7 elements are greater than his root.

3 votes
3 votes
In binary search tree root is greater than left Subtree and less than right subTree but in heap there are two cases

Case1:Max heap:Root is maximum in this if not then we have to heapify

Case 2:Min heap:Root is minimum in this if not then we have to do heapify

A) no because of 4

B) yes

C) no because of 1

D) same as c

So option b
Answer:

Related questions

2 votes
2 votes
6 answers
2
0 votes
0 votes
4 answers
4
go_editor asked Mar 24, 2020
989 views
Match the following :$\begin{array}{llll} & \textbf{List – I} & {} & \textbf{List – II} \\ \text{a.} & \text{Absurd} & \text{i.} & \text{Clearly impossible being con...