This is the lecture note of CS61B - Lecture 8.

This is the lecture note of CS61B - Lecture 7.

We have already seen how we can harness recursive class definition to build an expandable list, ie. the IntList, the SLList, and the DLList.

Now let us stop continuing it and try to use another basic data structure, array, to build list, which is called AList. You will find these two kinds of lists have differnet pros and cons.

This is the lecture note of CS61B - Lecture 6.

This is the lecture note of CS61B - Lecture 5.

This is the lecture note of CS61B - Lecture 4.

This is the lecture note of CS61B - Lecture 3.

In this lecture, we will discuss an important and realistic issue -- Testing.

This is the lecture note of CS61B - Lecture 2.

This is the lecture note of CS61B - Lecture 1.

This is the lecture note of CS61A - Lecture 20.

This is the lecture note of CS61A - Lecture 19.