CSSE 230: LinkedLists Part 2

Implement the following methods from the Java LinkedList class.

The methods that take a T parameter, as well as toArray() and toString() should have a worst case time complexity of N, where N is the length of the list.

The methods that take and int parameter should have a worst case time complexity of N/2+1, where N is the length of the list.

The iterators should instantiate a BasicIterator and use functors to account for their different behavior.

• add(int index, T element)
• contains(T o)
• descendingIterator()
• iterator()
• get(int index)
• indexOf(T element)
• lastIndexOf(T element)
• remove(int index)
• remove(T element)
• removeFirstOccurence(T element)
• removeLastOccurence(T element)
• toArray()
• toString();