Menu

Question Discussion & Solution

MCQ
Q.
The running time for creating a heap of size n is .............

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.
In a min heap
forum Discussion
MCQ
2.
If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree . What value will be at leaf nodes of the right subtree of the heap.

data-structure-questions-answers-heap-q7
forum Discussion
MCQ
3.
In a Heap tree
forum Discussion
MCQ
4.
What is the best case complexity in builading a heap?
forum Discussion
MCQ
5.
Choose the option with function having same complexity for a fibonacci heap.
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
Practice arrow_forward
article

Abstract data types

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Arrays

format_list_bulleted 134 MCQs
Practice arrow_forward
article

Lists

format_list_bulleted 166 MCQs
Practice arrow_forward
article

Stacks

format_list_bulleted 165 MCQs
Practice arrow_forward
article

Queues

format_list_bulleted 61 MCQs
Practice arrow_forward
article

Trees

format_list_bulleted 133 MCQs
Practice arrow_forward
article

Binary Trees

format_list_bulleted 120 MCQs
Practice arrow_forward
article

B Trees

format_list_bulleted 8 MCQs
Practice arrow_forward
article

Heaps

format_list_bulleted 36 MCQs
Practice arrow_forward
article

Hash based structures

format_list_bulleted 7 MCQs
Practice arrow_forward
article

Graphs

format_list_bulleted 157 MCQs
Practice arrow_forward
article

Mixed

format_list_bulleted 10 MCQs
Practice arrow_forward