Finally, we will study the priority queue data structure and showcase some applications. We will go through the quicksort and quickselect algorithms for sorting and selecting the kth smallest element ...

data structures and their algorithms. Topics include: data and procedural abstraction, amortized data structures, trees and search trees, hash tables, priority queues, graphs, shortest paths, ...

Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, heaps, priority queues, disjoint set unions, ...