Menu

Question Discussion & Solution

MCQ

Q.

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

A

O(n)

B

O(1)

C

O(logn)

D

O(nlogn)

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.

Heap exhibits the property of a binary tree?

A

1

C

May be

D

Can't say

Discussion

MCQ

2.

What is the space complexity of searching in a heap?

A

O(logn)

B

O(n)

C

O(1)

D

O(nlogn)

Discussion

MCQ

3.

Left child of parent node has value lesser than the parent node.

A

1

C

May be

D

Can't say

Discussion

MCQ

4.

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

A

complete binary tree

B

spanning tree

C

sparse tree

D

binary search tree

Discussion

MCQ

5.

The Statement

A

1

C

May be

D

Can't say

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