Slog #6 (Week 7/8) A Linked List To The Past

During weeks 7 and 8 we explored the ideas of linked lists. Simply put, a linked list is an abstract data type that consists of 2 parts, a head, and the tail. Now the head contains an object, usually a str or an int. Now here comes the cool part. The tail, consists of another linked list (well, the last linked list's tail is None).