Reading

None.

Getting comfortable with linked lists: iList

The iList Intelligent Tutoring System provides an environment and problem set for learning to manipulate programs. In class we'll get started working with it, and hopefully you can finish the problem set back in the Hall. Note: iList assumes the following struct for linked lists:
struct Node
{
  int data;
  Node* link;
};
I.e. it assumes linked lists of int's, and uses "link" instead of "next" as its name for the pointer that points to the next node in the list.

Problems

None.