Definition Of Linked List In Java

We can then use this iterator to traverse through the list and display elements.

Definition of linked list in java. The linkedlist class extends abstractsequentiallist and implements the list interface. 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. Linked list is the data structure which can overcome all the limitations of an array. All of the operations perform as could be expected for a doubly linked list.

Hierarchy of linkedlist class in java. Java linked list example of adding elements. The below program reverses the linked list using the descendingiterator method. Following are the constructors supported by the linkedlist class.

As shown in the above diagram java linkedlist class extends abstractsequentiallist class and implements list and deque interfaces. All the nodes of linked list are non contiguously stored in the memory and linked together with the help of pointers. Java linkedlist class can be used as a list stack or queue. Reverse linked list in java.

A linked list is a linear data structure in which the elements are not stored at contiguous memory locations. Implements all optional list operations and permits all elements including null. Note that this implementation is not synchronized. To reverse a linked list in java we use the descendingiterator method that returns a reverse iterator for the list.

It provides a linked list data structure. Hierarchy of linkedlist class. Operations that index into the list will traverse the list from the beginning or the end whichever is closer to the specified index. In simple words a linked list consists of nodes where each node contains a data field and a reference.

In the following example we are using add addfirst and addlast methods to add the elements at the desired locations in the linkedlist there are several such useful methods in the linkedlist class which i have mentioned at the end of this article. In the case of a doubly linked list we can add or remove elements from both sides. The elements are linked using pointers and addresses.