DSA Group 2 (Heaps Quiz)

Removes the maximum element from Max Heap.

• getMax()

• extractMax()

• insert()

• extractMin()

It returns the root element of Min Heap.

• getMin()

• extractMin()

• getMax()

• insert()

These are all the importance of Heap in programming EXCEPT:

• Efficient Priority Queues

• File Compression

• Memory Management

• Garbage Collection

A Heap is a special Tree-based data structure in which the tree is a complete binary tree where the value of each parent node is either higher or lower than the value of its child nodes.

• True

• False

These are all the various uses of Heap EXCEPT:

• Sorting Algorithms

• Dynamic Programming

• Load Balancing

• None of the above

it is a complete binary tree in which the value in each internal node is smaller

than or equal to the values in the children of that node.

• Min Heap

• Max Heap

It is a complete binary tree in which the value in each internal node is greater than or equal to the values in the children of that node.

• Min Heap

• Max Heap

Removes the minimum element from MinHeap. The Time Complexity of this Operation is O(Log n) as this operation needs to maintain the heap property (by calling heapify()) after removing the root.

• getMax()

• extractMax()

• getMin()

• extractMin()