Menu

Question Discussion & Solution

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

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
The main distinguishable characterstic of a binomial heap from a binary heap is that
forum Discussion
MCQ
2.
The running time for creating a heap of size n is .............
forum Discussion
MCQ
3.
In a min-heap:
forum Discussion
MCQ
4.
Left child of parent node has value lesser than the parent node.
forum Discussion
MCQ
5.
What is the complexity of adding an element to the heap.
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
article

Abstract data types

format_list_bulleted 37 MCQs
article

Arrays

format_list_bulleted 134 MCQs
article

Lists

format_list_bulleted 166 MCQs
article

Stacks

format_list_bulleted 165 MCQs
article

Queues

format_list_bulleted 61 MCQs
article

Trees

format_list_bulleted 133 MCQs
article

Binary Trees

format_list_bulleted 120 MCQs
article

B Trees

format_list_bulleted 8 MCQs
article

Heaps

format_list_bulleted 36 MCQs
article

Hash based structures

format_list_bulleted 7 MCQs
article

Graphs

format_list_bulleted 157 MCQs
article

Mixed

format_list_bulleted 10 MCQs