Linked Lists are relatively common and simple data structures that allow us to ’link’/chain data together. Linked Lists are useful for insertion/deletion (time complexity of O(1)), but are unfortunately not incredibly efficient when it comes to access and search (time complexity of O(n)). The core idea behind a linked list is that you have nodes that contain two pieces of information: The data itself A pointer towards the next piece of data The pointer is what chains the pieces of data to...
