Priority Queue ADT

🔥 heap based priority queue → A heap-based priority queue implements the priority_queue ADT by using a heap structure (e.g., binary heap) to realize insert/extract in O(log n) and peek in O(1) while maintaining priority order.

🌟 prim algorithm →

🌟 dijkstra algorithm →

🌟 minimum spanning tree →

⚡️ heap →

⚡️ pathfinding algorithms →

⚡️ a star search →

⚡️ huffman coding →

⚡️ k way merge →

⚡️ heap sort →