For this module, you should read the following sections of the textbook;
Chapter #12: Data Structures
In addition, you will find a mini-tutorial on hash tables supplementing the textbook, along with a
Code::Block project folder for you to experiment with. This archive contains the source code for a simple hash table implementation.
Study it after reading the tutorial in order to strengthen your understanding of this data structure
This exercise will allow us to leverage everything we have learned so far to implement a reusable linked list of integers.
You will find the PDF instructions, an overview video, & the template project to start working with. The first function
of our API is also implemented to allow us to build new linked lists.
We implement two versions of the function meant to display our linked list's data. We start with an
iterative one then move on to the recursive version. You will note that, when working on structurally
recursive data structures such as linked lists, recursion leads actually to simpler algorithms.
The key is often to match the tool to the task rather than argue endlessly about the abstract merits
of various tools.