Menu

Question Discussion & Solution

MCQ

Q.

Choose the option with function having same complexity for a fibonacci heap.

A

Insertion, Union

B

Insertion, Deletion

C

extract_min, insertion

D

Union, delete

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.

In a binomial heap the root value is greater than left child and less than right child.

A

1

C

May be

D

Can't say

Discussion

MCQ

2.

In a max-heap, element with the greatest key is always in the which node?

A

Leaf node

B

First node of left sub tree

C

root node

D

First node of right sub tree

Discussion

MCQ

3.

Time taken in decreasing the node value in a binomial heap is

A

O(n)

B

O(1)

C

O(logn)

D

O(nlogn)

Discussion

MCQ

4.

Does there exist a heap with seven distinct elements so that the Inorder traversal gives the element in sorted order.

A

Yes

B

No

C

May be

D

Can't say

Discussion

MCQ

5.

What is the space complexity of searching in a heap?

A

O(logn)

B

O(n)

C

O(1)

D

O(nlogn)

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