Linked Lists Tutorial #3: removing a linked list from memory (Updated)

In computer science, a linked list is a linear collection of data elements, called nodes pointing to the next node by means of pointer.
This data structure serves as a foundation upon which other data structures such as the doubly linked list, circular linked list, stack, queue, priority queue, trees, etc can be built. A thorough understanding of the linked list is, therefore, essential.
// Join our message board:
professorhank.freeforums.net/
// Join this channel to get access to perks:
/ @professorhankstalica
// Consider supporting this channel in multiple ways
wise.com/pay/me/henrys814
paypal.me/hankstalica1
Bitcoin: 177wfkQwzXiC8o2whQMVpSyuWUs95krKYB