Linked List (java.util.collections)

Linked List is a part of the Collection framework present in java.util package. This class is an implementation of the LinkedList data structure which is a linear data structure where the elements are not stored in contiguous locations and every element is a separate object with a data part and address part. The elements are linked using pointers and addresses. Each element is known as a node.

Instantiate

LinkedList<datatype> ll = new LinkedList<datatype>();

Methods (ll)

tip

The below listed methods works with all list types

• add() - adding element to Linked List

  ll.add(element);

  ll.add(int index, element); //add element at position *index*

  ll.addLast(element); //add element at last of list

  ll.addFirst(element); //add element at first of list

  ll.addAll(int index,List list); // add all elements of list to ll from index position

• remove() - removing element from Linked List

  ll.remove(element);

  ll.remove(int index); //remove element from position *index*

  ll.removeLast(element); //remove element from last of list

  ll.removeFirst(element); //remove element from first of list

• size() - returns size of list

  int n = ll.size();

• contains() - returns true/ false if element is present in list

  int n = ll.contains(element);

• set() - replace element at index

  ll.set(int index, newElement);

• get() - returns element at index of list

  datatype n = ll.get(int index);

  datatype n = ll.getFirst(int index);

  datatype n = ll.getLast(int index);

• subList() - create a sub list from index start to end-1

  List newList = oldList.subList(int start, int end);