Before break, we started into lists. Specifically, linked lists.
I thought I'd point out a few resources online surrounding linked lists. By pointing out these resources, I'm not trying to imply that you might, if you're so inclined, possibly take a look. Instead, I'm suggesting that you should master the material surrounding lists by any means possible. These resources represent textual and video sources that may help you attain that mastery. Naturally, content I generate and exercises I provide will help, but this is the year 2009: there are lots of other resources you can leverage, and ultimately, you are responsible for your learning.
Pointers
You might want to take a look at this video with Binky, where he talks about pointers. You've seen this more than once already (and it was, inherently, part of the quiz regarding equality). You'll need to right-click and download the video, though.
Binky and Pointers (Java edition)
Lists
From Berkeley, there are a pair of lectures on linked lists. I think this presentation of material represents a hard-core "talking head" lecture format, but it is thorough. This material is also in the course text, so they should complement each-other.
CS61B Lecture 7: Lists I
Analysis
From MIT, an overview regarding the analysis of algorithms. It really doesn't start until ~20 minutes in. This is looking forward, but I wanted to capture the link.
MIT OpenCourseware: Intro to Analysis of Algorithms
Coming Soon...
In searching the web, I've realized that there is less material online than I had hoped that I actually like for introducing the concepts surrounding linked lists in a visual manner. I'm going to do my best to come up with a few videos of my own.
