CS21 Lab: LinkedLists

This lab is OPTIONAL. However, you may want to write these methods as practice for the final exam.

Implementing a linked list class

For this lab, run update21 to get a clean copy of the code we wrote in class in your cs21/labs/11 directory. You should have the Node class and the start of the LinkedList class.

Your job for this lab is to write/finish the linked list class so that it behaves like a Python list. In particular, your class must support the following methods:

More detailed documentation is provided in the linkedlist.py file. To get you started, we have already written the __init__() and __str__() methods. You may also use any code that we have given you or that we have worked on in class together. The first part of the lab is to understand exactly what the methods we went over in class are doing. Remember, there are three attributes that the linked list must always keep up to date: head, tail, and size. At the end of every method call, all three of these attributes must be correct. Watch out for special cases, such as deleting a node when there's only one node left in the list.

Note: If you need to insert or remove an item from the beginning or end of the list in one of your methods (for example, a call of pop(0) will remove the first item in the list), your method should call the methods you specifically wrote to handle these situations (e.g., remove_from_head()).

Testing your code

You should always test your code! We have provided various assert statements. As you write each method, uncomment the corresponding test code and make sure it passes. No output means the test passed. If the test doesn't pass, you will see an AssertionError. Here are a few examples:

    # Test the constructor __init__, __str__, append and len
    LL = LinkedList()
    assert len(LL) == 0
    assert str(LL) == "[]"
    assert len(LL) == 3
    assert str(LL) == "[A, B, C]"

Optional Challenge

The following methods allow linked list objects to use square-bracket indexing and the membership (in) operator. If you have time, see if you can implement these extra methods: