+A **priority queue** is an [Abstract Data Type](/wiki/abstract_data_type) where each item carries a priority. Unlike a standard [Queue](/wiki/queue), elements are retrieved based on their priority value, ensuring the highest (or lowest) priority item is always processed first. This structure is essential for tasks demanding ordered processing.
+## See also
+- [Heap](/wiki/heap)
+- [Stack](/wiki/stack)
+- [Graph Algorithm](/wiki/graph_algorithm)
... 1 more lines