Question Discussion & Solution

MCQ

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

logn

nlogn

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

The Statement

May be

Can't say

Discussion

MCQ

What is order of resultant heap after merging two tree of order k?

2*k

k+1

k*k

k+logk

Discussion

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

The worst case complexity of deleting any arbitrary node value element from heap is

O(logn)

O(n)

O(nlogn)

O(n^2)

Discussion

MCQ

What is wrong with the following code of insertion in fibonacci heap. Choose the correct option

FIB-INSERT(H, x)
 degree[x]= 0
 p[x]=  NIL
 child[x] =NIL
 left[x] =x
 right[x] =x
 mark[x] =FALSE
 concatenate the root list containing x with root list H 
 if min[H] = NIL or key[x] > key[min[H]]
 then min[H]= x
 n[H]= n[H] + 1

Line -11

Line -3

Line 9

Line 7

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