A linked list is a collection of linear data elements. Each element, or node, has two parts: the data and the reference. 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 in arrays is not possible. Instead, we traverse from the beginning of the list and access the elements.
In Java, the
LinkedList
is theimplementation of the List and Dequeue interfaces. The doubly-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. LinkedList
class is present in thejava.util
package.
getFirst
method of the LinkedList
class?The getFirst
method can be used to get the first element of the LinkedList
.
public E getFirst();
This method doesn’t take any argument.
This method returns the first element of the list
.
If the list is empty, then the NoSuchElementException
exception is thrown.
The code below demonstrates how to use the getFirst
method:
import java.util.LinkedList;class LinkedListGetFirst {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("The first element of the list is " + list.getFirst());}}
In the code above:
LinkedList
class.import java.util.LinkedList;
LinkedList
objects with the name list
.LinkedList<String> list = new LinkedList<>();
add
method of the list
object to add three elements ("1","2","3"
) to the list.list.add("1");
list.add("2");
list.add("3");
getFirst
method of the list
object to get the first element of the list.list.getFirst(); // "1"