SLOG Entry#6

     Hello SLOG blog readers. This week in computer science, we looked further in depth into Linked Lists. To restate from last week, Linked Lists are trees with one child and an empty last node. But they can be implemented in two different ways. Linked lists can consist of an item and a link to another Linked list, or an object with a reference to another object. These seem identical, but there's a difference in the semantics. Which in turn, requires different methods of coding in the Linked List class.We also covered Binary Search Trees, trees that are sorted by the values of their objects, making searches quicker and more efficient. It was a fun week. Come back next week for another computer science update.