Implement the Priority Queue Data Structure

The project currently lacks implementations of the Priority Queue data structure.

- Create PriorityQueue.js file in the project directory.

- Describe the Priority Queue data structure.

- Implement the Priority Queue data structure in JavaScript including methods like enqueue, dequeue, and peek. Implement both max-priority and min-priority queues.

- Include an example demonstrating task scheduling or Dijkstra’s algorithm integration.

- Add the data structure to the "JavaScript Data Structures" section in the README.

Start by reviewing the project structure and the existing JavaScript Data Structures section in README. Create PriorityQueue.js with enqueue, dequeue, and peek for both max-priority and min-priority queues, add a task-scheduling or Dijkstra’s algorithm example, and document the structure in README.

Vom Indexierungsmodell aus dem Issue-Text verfasst.