Implement a linked list in python from scratch (not to be compared to, or compete with collections.deque!)
A linked list class is instantiated using ll()
Underneath the call the node class is used to construct the node list and hold information to the pointers to the neightbour nodes.
Current implementation of the singly linked list means only information on the next node is kept. Not the previous node as per doubly linked lists.
#Instantiate a new class
newL = ll()
#push values to the head
>>> newL.push(1)
>>> newL.push(2)
>>> newL.push(5)
#the pretty print function shows a graphical visual of the linked list
>>> newL
1 -> 2 -> 5 -> None
#the class is iterable!
>>> for i,j in enumerate(newL):
... print(i);print(j)
0
1
1
2
2
https://realpython.com/linked-lists-python/#using-advanced-linked-lists
https://www.geeksforgeeks.org/data-structures/linked-list/
https://realpython.com/null-in-python/
https://www.freecodecamp.org/news/data-structures-in-javascript-with-examples/
Diagram of the *pop()* method adding a node to the head of the list and reassigning the tail of the head node