LinkedList remove element

In this chapter you will learn:

  1. Remove element from a LinkedList
  2. Remove all elements from LinkedList

Remove element from a LinkedList

The following methods remove elements from a LinkedList at various positions.

  • E remove() Retrieves and removes the first element.
  • E remove(int index) Removes the element at the specified position.
  • boolean remove(Object o) Removes the first occurrence of the specified element, if it is present.
  • E removeFirst() Removes and returns the first element.
  • boolean removeFirstOccurrence(Object o) Removes the first occurrence of the specified element(when traversing the list from head to tail).
  • E removeLast() Removes and returns the last element.
  • boolean removeLastOccurrence(Object o) Removes the last occurrence of the specified element(when traversing the list from head to tail).
import java.util.LinkedList;
/*from   j  a  v  a 2s .c o  m*/
public class Main{
    public static void main(String args[]) {
        LinkedList<String> ll = new LinkedList<String>();

        ll.add("A");
        ll.add("java2s.com");
        ll.add("B");
        ll.add("C");
        ll.add("java2s.com");


        String str = ll.remove();
        System.out.println(str);
        System.out.println(ll);
    }
}

The output:

The following code removes the last element in a LinkedList.

import java.util.LinkedList;
/*from j a  va 2  s. c  om*/
public class Main{
    public static void main(String args[]) {
        LinkedList<String> ll = new LinkedList<String>();

        ll.add("A");
        ll.add("java2s.com");
        ll.add("B");
        ll.add("C");
        ll.add("java2s.com");


        String str = ll.removeLast();
        System.out.println(str);
        System.out.println(ll);
    }
}

The output:

Remove all elements from LinkedList

void clear() Removes all of the elements from this list.

import java.util.LinkedList;
// j  ava  2  s . co m
public class Main{
    public static void main(String args[]) {

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


        ll.add("B");
        ll.add("ja v a2s.com");
        ll.addLast("E");
        ll.add("F");


        System.out.println("Original contents of ll: " + ll);

        ll.clear();
        
        System.out.println(ll);
    }
}

The output:

From the output we can see that after calling clear method the LinkedList becomes empty.

Next chapter...

What you will learn in the next chapter:

  1. Shallow copy of a LinkedList
Home » Java Tutorial » Collections

List interface
List add/insert elements
List clear/remove elements
List search
List element get and set
List and its Iterator
List size, empty
List conversion, to array
List to sublist
List comparison
ArrayList
ArrayList Creation
ArrayList add/insert
ArrayList get/set element
ArrayList clear/remove
ArrayList search
ArrayList copy and shallow copy
ArrayList size, trim to size and capacity
ArrayList to array
LinkedList class
LinkedList creation
LinkedList add/insert elements
LinkedList get elements
LinkedList search
LinkeList replace/set elements
LinkedList remove element
LinkedList copy
LinkedList iterator
LinkedList peek element
LinkedList pop/push element
LinkedList conversion
Map interface
Map element adding
Map.Entry class
Map key
Map value
Map key/value search
Map delete/remove
Map comparison
HashMap Class
HashMap search
HashMap clone
TreeMap
TreeMap key
TreeMap head sub map
TreeMap tail sub map
TreeMap sub map
NavigableMap
NavigableMap key
NavigableMap key-value pair
LinkedHashMap Class
IdentityHashMap
SortedMap
HashSet
HashSet element adding
HashSet element removing and clearing
HashSet clone
HashSet iterator
HashSet properties
TreeSet
TreeSet elements adding
TreeSet subSet
NavigableSet
LinkedHashSet
Iterator
ListIterator
List filling
List reversing
List rotating and shuffling
List sorting
List element swap
List element replacing
List copy
List binary search
Collection unmodifiable
Collection synchronized
Collection singleton
Collection max/min value
Empty Collections
Comparator
Comparable
Enumeration
EnumSet
EnumMap Class
PriorityQueue