Menu

Question Discussion & Solution

MCQ

Q.

The worst case complexity of deleting any arbitrary node value element from heap is

A

O(logn)

B

O(n)

C

O(nlogn)

D

O(n^2)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

The Statement

A

1

C

May be

D

Can't say

Discussion

MCQ

2.

Heap can be used as ________________

A

Priority queue

B

Stack

C

A decreasing order array

D

None of the mentioned

Discussion

MCQ

3.

The number of trees in a binomial heap with n nodes is

A

logn

B

n

C

nlogn

D

n/2

Discussion

MCQ

4.

In a min-heap:

A

parent nodes have values greater than or equal to their Children

B

parent nodes have values less than or equal to their Children

C

both statements are true

D

both statements are wrong

Discussion

MCQ

5.

Heap is an example of ................

A

complete binary tree

B

spanning tree

C

sparse tree

D

binary search tree

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs