Through these algorithms the student will be introduced to ... data structures such as first-in first out queues and last-in first out stack. Next, we introduce the heap data structure and the basic ...

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

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, ...