What is the LinkedList.remove method in Java?
A linked list is a collection of linear data elements. Each element (node) contains data and reference parts. The data part has the value and the reference part has the address link to the next element.
The elements are not indexed, so random access like an array is not possible. Instead, we traverse from the beginning of the list and access the elements.
In Java, the
LinkedListclass is theimplementation of the doubly-linked list A kind of linked list. Each node contains three fields: two link fields (one for the previous element and another for the next element) and one data field. ListandDequeinterfaces. TheLinkedListclass is present in thejava.utilpackage.
The remove method
The remove method can be used to remove the head (first) element of the LinkedList.
Syntax
public E remove();
Parameters
This method doesn’t take any arguments.
Return value
This method removes and returns the first element of the list. If the list is empty then the NoSuchElementException exception is thrown.
Code
The code below demonstrates how to use the remove method.
import java.util.LinkedList;class LinkedListRemove {public static void main( String args[] ) {LinkedList<String> list = new LinkedList<>();list.add("1");list.add("2");list.add("3");System.out.println("The list is " + list);System.out.println("Removing first element of the list : " + list.remove());System.out.println("The list is " + list);}}
Explanation
In the code above:
- In line 1, we imported the
LinkedListclass.
import java.util.LinkedList;
- In line 4, we created a
LinkedListobject with the namelist.
LinkedList<String> list = new LinkedList<>();
- From lines 5 to 7, we used the
addmethod of thelistobject to add three elements ("1","2","3") to the list.
list.add("1");
list.add("2");
list.add("3");
- In line 10, we used the
removemethod of thelistobject to remove the first element of the list. This method will remove the first element of the list and return the removed element.
list.remove(); // "1"
list; // ["2", "3"]
