This week we learned a new common data structure called linked list which made up of nodes. A linked list is also a recursive data structure that contains head and rest. Since we all knew how the linked list should look like, I am not going to specify anymore. After the lectures and having some reading, we can probably understand how the linked list methods work and get a better comprehension of the usage of them. However, one thing that made me went crazy was the linked list lab for this week. It required us to implement the Queue ADT using a linked list. I just felt like I wasted two hours lab time since I can only inplement few of them.
One more sad thing here. I made a little mistake in the first term test about inorder traversal, and I lost the whole mark of that question! (I deserve part mark....)
没有评论:
发表评论