Question Discussion & Solution

MCQ

The total comparisons in finding both smallest and largest elements are

2*n +2

n + ((n+1)/2) -2

n+logn

n^2

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

What is the worst case time in searching minimum value in weak -heap?

O(log n)

O(n)

O(n logn)

O(1)

Discussion

MCQ

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

Yes

May be

Can't say

Discussion

MCQ

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

logn

nlogn

n/2

Discussion

MCQ

Choose the correct properties of weak-heap.

Every node has value greater than the value of child node

Every right child of node has greater value than parent node

Every left child of node has greater value than parent node

None of the mentioned

Discussion

MCQ

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

O(n)

O(1)

O(logn)

O(nlogn)

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics