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

Data structures that can implement the List ADT include fixed-size and dynamically sized one-dimensional arrays and singly-linked lists. (You’ll be introduced to arrays in Part 2, and linked ...