removeLast() and removeFirst() methods are used to remove elements in end and beginning of a linked list.

AbstractMap, WeakHashMap, HashMap and TreeMap provide implementation of map interface.

Map

remove()

An element in a LinkedList object can be changed by first using get() to obtain the index or location of that object and the passing that location to method set() along with its new value.

HashSet and TreeSet implements Set interface where as LinkedList and ArrayList implements List interface.

An element in a LinkedList object can be changed by first using get() to obtain the index or location of that object and the passing that location to method set() along with its new value.

sort()

binaryserach() method uses binary search to find a specified value. This method must be applied to sorted arrays.

fill() method assigns a value to all the elements in an array, in other words it fills the array with specified value.