#28 - What is PriorityQueue in Java with Examples (using Comparator)

In this video, I have explained - What is PriorityQueue with Examples (using Comparator).
Java Collection Series (2021) Latest videos on ArrayList, HashMap, Concurrent HashMap and full collection APIs.
• Latest Java Collection...
~~~Subscribe to this channel, and press bell icon to get some interesting videos on Selenium and Automation:
kzbin.info%20Au...
Follow me on my Facebook Page:
/ naveenqtpexpert
Let's join our Automation community for some amazing knowledge sharing and group discussion on Telegram:
t.me/joinchat/9FrG-KzGlvxjNmQ1
Naveen AutomationLabs Paid Courses:
Java & Selenium:
naveenautomationlabs.com/manua...
Java & API +POSTMAN + RestAssured + HttpClient:
naveenautomationlabs.com/selen...

[@MrFahimansari]

This is the best video I ever found on Priority queue. Keep up the good work and thanks for the video.

[@nitityagi3517]

Really helpful series to understand Java collections. Thankyou Naveen

[@shobhitranjan3957]

brilliantly explained!

[@vengateshm2122]

Thanks much. Really useful.

[@amirzojaji482]

thnx a lot dear. this video made my day.

[@hiteshdarji9925]

Great work bhai.

[@sureshgarine]

Thank you Naveen, this is a really helpful video. rather than, poll(), it would be nice to use peek(), it just returns the object rather than return and removes the object from the priority queue

[@amine_fadssi]

It depends on the situation.

[@equinox6467]

This may seem like a really, really dumb question, but how does the process work when you wrote the code of "e1.salary - e2.salary"? How does it arrange it in a way that you can get the lowest salary using such logic? For some reason, I just couldn't wrap my head over it.

[@yawenwang7397]

same question

[@asganaway]

From the Java Docs of Comparable: " Compares this object with the specified object for order. Returns a negative integer, zero, or a positive integer as this object is less than, equal to, or greater than the specified object." So he just subtract the two values he's interested in and he inverted the objects order when he want to give priority to the biggest salary.

[@user-xq8pv6es5x]

@@asganaway yeah, but it did not explain why e1.salary - e2.salary is ascending and e2.salary - e1.salary is descending.

[@rajeshyadav-cw6vc]

Thank sir👌

[@pavangowda1418]

In java which version u r doing

[@user-kv6bl8ct9g]

Hello, thanks for this. I wonder if you also do tutorials, one on one?

[@vikashshrivastav1051]

please make a video of comparator and comparable

[@Maheshkumar-iq4bi]

👍👍

[@PriyankaShinde-mp6lt]

it won't sort - I am adding 20 3 7 8 10 4 after I print the PQueue I get output as [3, 8, 4, 20, 10, 7] how it is sorting, could you please explain?

[@vinayjangra1401]

@Abina Joshi can you show your code? May be i can help

[@kaushik.aryan04]

as its a heap not a sorted array heap is not sorted

[@gauri_korde]

same here

[@prasoonlall9432]

PQ gives you either the least element (minheap) or the greatest element(maxheap) when you poll the values one by one. It auto-arranges the rest based on the comparator provided. It does not sort the whole arrays altogether at one go. So if you poll the least element once, if you go on to poll again - it'll give you the second lowest element and it goes on. Similarly for max heap (greatest values).

[@pqsk]

No love for employee *E* and *D*