I am using a PriorityQueue to solve the Meeting Rooms II problem from Leetcode. I have developed my own solution that fails on certain test cases, yet from my eyes it is indistinguishable from the pro...

In A* search, which data structure would be more efficient ? Min-heap or Binary search tree. Considering that below operations are to be handled frequently: (a) extract min (b) search a node (c) updat...

I'm trying to write a minimum heap data structure in C, but I ran into some issues while implementing the insert function. It looks like this : void insert(MinHeap* minh , int key) { if(minh->i...

I was asked this question on a test and would like to make sure I answered correctly: You are given a min heap. We want to increase all the nodes on the left most path (so the root, node 2, node 4, n...