Python has dynamic arrays, which makes it harder to explain linked lists in that context. In a language like C, you manage memory yourself. If you have an arbitrarily sized number of elements to add to an array, and you don't allocate enough memory to your array to hold them, you will have problems. So what do you do if you aren't sure how many items will be added to a list (and therefore how much memory to allocate)? One solution is to use a linked list. This is a series of nodes. You can think of a node as an object that has two properties: the data you want to hold and then a pointer to where you can find the next node, which itself holds another piece of data and the pointer to the next object on the linked list. I like to visualize this as a string of beads, each bead being a node. You can achieve something similar in Python with classes. In C, the "next node" property would point to a memory address where the next element on the linked lost lives. In Python, you can instantiate a new node object and store it in the previous node's "next node" property. More on reddit.com

You want to clear the contents on the linked list? All that would be required is self.head = None. del current.data on each node is not necessary. ... I know, that what I thought but on GeeksForGeeks it says I need to delete the data of each node. But what about the next part of each node? It is also occupying the memory right? ... Deleting every node one by one yourself would be necessary in a language where the programmer handles the memory themselves. Python ... More on stackoverflow.com

Insert creates a new Node, named newNode. If there's already a head Node in the LinkedList, current is set to the head and then it's advanced to the end of the list, then newNode is inserted there. If there's no head node, the newNode is made the head. More on reddit.com

Python's dictionaries are implemented in C using both arrays and linked lists (IIRC), but outside of specific applications I wouldn't say they're common in modern code. While they have a theoretical speed benefit for writes, in practice this rarely happens because unlike arrays they don't really benefit from CPU caching due to the nodes being all over the memory rather than in continuous blocks, so the only real benefit they offer is storing data when the memory is fragmented and there's no room for a continuous block an array would need. I've written a few linked list implementations for fun, but personally I haven't been in a scenario where I'd want to use one. More on reddit.com