Heap Explained and Implemented in Java | Maximum and Minimum Heaps | Priority Queues | Geekific

[@TuanNguyen-ie2zm]

Your voice is very clearly and easy to hear, thanks so much for these explanation, very useful. Never get bored while learning with your videos

[@guilhermealvessilveira8938]

You code is really good, it's easy to undestand. Good work!

[@geekific]

Glad you think so! Thanks a lot :)

[@justinstorm]

Thank you. Very helpful in understanding

[@geekific]

Glad it was helpful!

[@th2315]

you are awesome

[@niranjankumar-uk8sk]

prirotyqueuepq=new Priorityqueue(a,b)->(a[0]-b[0]) ca u explain sir what does it mean how values are add

[@geekific]

Hello! This does not figure anywhere in this video. However, this a priority queue that stores arrays of ints, and the comparator passed to the constructor uses the very first element of every array stored in the queue to determine its priority and poll the elements accordingly. Cheers!