page 1 out of 2
page 1 out of 2
Question 1
Which of the following arrays is a max heap?
Question 2
Given two max heaps of size n each, what is the minimum possible time complexity to make a one max-heap of size from elements of two max heaps?
Question 3
In a binary max heap containing n numbers, the smallest element can be found in time
Question 4
Given two max heaps of size n each, what is the minimum possible time complexity to make a one max-heap of size from elements of two max heaps?
Question 5
In a max-heap, element with the greatest key is always in the which node?
Question 6
How many type of heap are there?
Question 7
What is the complexity of removing an element to the heap?
Question 8
Heap can be used as ?
Question 9
An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
Question 10
Identify binary min heap
page 1 out of 2
page 1 out of 2