Week - 8: Linked List

Linked List is essentially a tree that ran linearly and had no depth. It is a list but each of the values in the list pointed to the next value. So if I had a Linked List with values 1, 2, 3, 4 then the Linked List would have the value 1 pointing to value 2 and then it would be pointing to values 3 and so forth. Removing an item from the Linked List was also easy. Instead of shifting the whole list like in a normal list, you would just change which values pointed to what. Let's say we wanted to remove 2 from the Linked List 1, 2, 3, 4. We would just get value 1 to point to value 3 and that's all you had to do. Since nothing pointed to 2, it didn't exist in the Linked List anymore.

This week's lab was really confusing. I did not really understood what my TA was asking of me to do. It was very confusing. Better luck next week.