Take the Linked List that you've implemented, and annotate each method (put a
comment next to each method) describing the running time of that method, using
the Big "Oh" notation.
REMOVED FROM STUDENT VIEW, but left here for future use.
STUDENTS: If you can see this, please (1) let the teacher know, and (2)
ignore this box
For
all the methods, make sure that you distinguish between the time required to do
the operation on a sorted list, and an unsorted list. If the two versions
require the same amount of time make sure that you clearly explain why that's
true.