In contrast, a data structure is a concrete implementation of one or more ADTs, similar to how Java classes implement interfaces. Examples of ADTs include Employee, Vehicle, Array, and List.

Analyze the time and space complexity of your solution. Compare your solution to others and identify areas for improvement.

I’ve focused on two data structure categories, Java arrays and linked lists, which are the basis of more complex data structures such as stacks, queues, trees, graphs, dictionaries/maps, and sets.

Learn when and how to use different data structures and their algorithms in your own code. This is harder as a student, as the problem assignments you'll work through just won't impart this knowledge.