Vidyalelo
Data Structure · all questions

Heaps
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

166

Questions

9/9

Page

Pick an option on a question to see the right answer and solution.

How many secondary operations are performed in a d-heap?

Select an option to see the answer and solution.

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

Select an option to see the answer and solution.

The worst case analysis for a naive merge is given as?

Select an option to see the answer and solution.

What is the run time efficiency of delete-min operation?

Select an option to see the answer and solution.

What is the time complexity for increasing priority of key in a minimum ternary heap of n elements?

Select an option to see the answer and solution.

The total comparisons in finding both smallest and largest elements are

Select an option to see the answer and solution.