CSC148 Week9 Slog: My impressions of week8

      In the week 8 lecture, it was about Linked Lists. At first, I didn't understand the concept of the Linked Lists. Term test 2 was coming in week 9 and I didn't know much about Tree too so I was scared of new concept. As I understood the concept, I figured out that Linked Lists work together with LLNode. Inside LLNode variables, there is nxt which works as children in Tree class. Then inside the Linked List class, there is two variables: front and back, which works as Binary Tree's left and right variables. Except in the Linked List class, there is self.size which determines how many nodes are there. As I thought the concept that way, it was easy to understand how Linked Lists and LLNode worked.