PriorityQueue using LinkedList in Java

[PrathamKashyap1]

Information about Algorithm

This is an algorithm for priority queue. it adds the element based on its priority i.e., at its correct position. Insert will insert based on its priority. remove function will return the element with highest priority (either largest or smallest) . Usually it is the first element. Remaining functions are same as a normal queue. This algorithm works better than array implementation since we can have dynamic size and easily add elements instead of shifting the array elements.

Have you read the Contributing.md and Code of conduct

• Yes
• No

P.S.

I am very much excited to contribute as this is my first contribution.
So please assign this issue to me @TawfikYasser @mohitchakraverty

Looking forward for a quick reply.

[welcome]

Thanks for opening your first issue here! Be sure to follow the issue template!