A priority queue is an abstract data type that stores elements with associated priorities, where elements with higher priority are served before those with lower priority. It can be implemented using heaps or other methods such as unordered arrays, and is conceptually distinct from heaps.
University of Washington
Summer 2022
This course is a continuation of CSE 142, focusing on manipulating data, implementing data structures, and learning about algorithms in Java. It delves into abstract data types, recursion, inheritance, and more.
No concepts data
+ 34 more conceptsPrinceton University
Spring 2023
This course surveys crucial algorithms and data structures used in modern computing, with emphasis on sorting, searching, graphs, and strings. It aims to develop implementations, understand their performance, and evaluate their effectiveness.
No concepts data
+ 25 more concepts