Part 1 – Summary and Specific Instructions
1. Implement Deque and Bag ADT interfaces with a Singly Linked List data structure by
completing the skeleton code provided in the file sll.py. Once completed, your
implementation will include the following methods:
add_front(), add_back()
insert_at_index()
remove_front(), remove_back()
remove_at_index()
get_front(), get_back()
remove()
count()
slice()
2. We will test your implementation with different types of objects, not just integers.
We guarantee that all such objects will have correct implementations of methods
__eq__, __lt__, __gt__, __ge__, __le__, and __str__.
3. The number of objects stored in the list at any given time will be between 0 and 900
inclusive.
4. Variables in the SLNode and LinkedList classes are not marked as private. For this
portion of the assignment, you are allowed to access and change their values
directly. You are not required to write getter or setter methods for them.
5. RESTRICTIONS: You are not allowed to use ANY built-in Python data structures or
their methods. All implementations in this part of the assignment must be
done recursively. You are not allowed to use while- or for- loops in this part
of the assignment.