Heap Fundamentals - Priority Queue / Heap / Introduction

Problems
24

I’m going through them and making them overwhelming

25

In the “Heap in C++” section, there are some typos in the Task struct constructor. The constructor is named Element when it should be Task. And there’s a typo in the initializer list for priority.

26

A short Java top 3 smallest numbers problem implementation:

public class HeapTop3 {
    public static List<Integer> heapTop3(List<Integer> arr) {
        PriorityQueue<Integer> maxHeap = new PriorityQueue<>(arr);
        return List.of(maxHeap.poll(), maxHeap.poll(), maxHeap.poll());
    }
    ...
}
27

Please add Heap into Templates section - it would be super useful!!!