Covers algorithms and their performance analysis, data structures, abstraction, and encapsulation. Introduces stacks, queues, linked lists, trees, heaps, priority queues, and hash tables, and their ...

An ADT doesn’t care about the memory representation of ... from single variables to arrays or linked lists of objects containing multiple fields. All data structures can be classified as ...

lists, trees) and their representation techniques (e.g., linking, arrays). Introduces concepts used in algorithm design and analysis including criteria for selecting data structures to fit their ...