Скачать или смотреть Python Linked list implementation II - traverse

Python Linked list implementation II - traverse

What if we would like to insert some items at the end of the list.

I'm going to have the insertEnd method with the Self and the data we would like to insert, and basically, we just have to iterate through the list. So first we have to increment Self.size is equal to the Self.size plus one. We increment the size, we create a new node that is equal to the data. This is how we instantiate a class, and we have a reference to the actual node we initialize it to be the head a sort of the first node in the linked list.

While this actualNode.nextNode is not equal to null, so is not a null or a none. Then we basically hope this actualNode is equal to the actualNode.nextNode. So basically we would like to find the end of the linked list. This is how we iterate through the list and find the last one, and basically we just have to update that actualNode.nextNode is equal to the new node. This is how we insert that gives a new node to its position and basically that's all about it.

Thanks for watching!