In my previous article, we implemented a linked list data structure with some very basic operations. While those operations are useful in many cases, they won’t take us very far. That’s is why in this (and subsequent) post we’ll talk about more advanced actions we can perform on our linked lists.
I’ve seen quite a few people thinking that linked lists are very tricky to understand and then to perform operations on them. What about data and pointer components? Why do we even need this data structure? As with many things, it might be scary to dive into an unknown concept. In order to understand more advanced variants of linked lists (like stacks and queues, which we’ll talk about in our future articles), we’ll have to take a look at the basics of their parent - please welcome a linked list!