# Arrays and Trees Quiz 1

Question 1

Time: 00:00:00
Parent nodes have values greater than or equal to childs in ___

max heap

max heap

min heap

min heap

both a and b

both a and b

none of the above

none of the above

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 2

Time: 00:00:00
What is min heap?

Parent nodes have values lesser than or equal to child

Parent nodes have values lesser than or equal to child

Parent nodes have values greater than or equal to child

Parent nodes have values greater than or equal to child

heap with maximum value always at right node

heap with maximum value always at right node

none of the above

none of the above

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 3

Time: 00:00:00
A min-max heap is a complete binary tree data structure

True

True

False

False

cannot determined

cannot determined

none of the above

none of the above

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 4

Time: 00:00:00
Average time complexity to insert element in min-max heap is

O(n)

O(n)

O(n*logn)

O(n*logn)

O(n^2)

O(n^2)

O(logn)

O(logn)

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 5

Time: 00:00:00
Consider min-max heap , which of the following is true

Time complexity to insert is larger than delete

Time complexity to insert is larger than delete

Time complexity to insert is lesser than delete

Time complexity to insert is lesser than delete

Both insert and delete has same time complexity

Both insert and delete has same time complexity

none of the above

none of the above

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 6

Time: 00:00:00
Each node in a tree has how many child nodes ?

Zero

Zero

one

one

two

two

Zero or more

Zero or more

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 7

Time: 00:00:00
Top most node in a tree is called ?

root

root

parent

parent

left

left

right

right

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 8

Time: 00:00:00
Is it a root node and parent node or same?

Yes

Yes

no

no

Sometimes it is same

Sometimes it is same

none of the above

none of the above

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 9

Time: 00:00:00
Can a node have more than one parent node?

yes , it is possible

yes , it is possible

no , it shouldn’t have more than one parent (inbound edge)

no , it shouldn’t have more than one parent (inbound edge)

Sometimes possible

Sometimes possible

none of the above

none of the above

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 10

Time: 00:00:00
Node can have multiple ancestor nodes

True

True

False

False

Cannot say

Cannot say

None of the above

None of the above

Once you attempt the question then PrepInsta explanation will be displayed.

Start

["0","40","60","80","100"]
["Need more practice!","Keep trying!","Not bad!","Good work!","Perfect!"]

Personalized Analytics only Availble for Logged in users

Analytics below shows your performance in various Mocks on PrepInsta

Your average Analytics for this Quiz

Rank

-

Percentile

0%

Completed

0/0

Accuracy

0%

Prime