Lately in CSC148, we have been learning about linked lists. We also just wrote the second mid term. I think the term test went pretty well. There was one question on the test that involved linked lists. I found the linked list material quite easy to grasp.
Linked lists are pretty interesting. It consists of black boxes that all point to another black box, and this is how they are all linked together. It is like a train of nodes. They are similar to trees in a way, but also very different. To go visit a specific node in a linked list, it seems that you have to start at the front and iterate through the entire linked list.
I don't know TOO much about linked lists yet. I still don't see the advantage to using them over regular lists, but I feel that when we start including recursion into linked lists, I will see the point. Here is a picture to illustrate the difference between a regular list and a linked list.
I will keep you updated on linked lists and everything else going on in this class.
Thanks,
J.M.
No comments:
Post a Comment