Now, Let’s see an example of a Linked List Node:
As in the above code, we define a class Node having two properties: element and next. Element holds the data of a node while next holds the pointer to the next node, which is initialized to the null value.
Now, let’s see an implementation of the Linked List class:
The above example shows a Linked List class with a constructor and a list of methods to be implemented. Linked List class has two properties: i.e. head and size, where the head stores the first node of a List, and size indicates the number of nodes in a list.
Let’s implement each of these functions:
1. add(element) – It adds an element at the end of the list.
In the order to add an element at the end of the list we consider the following :
- If the list is empty then add an element and it will be head
- If the list is not empty then iterate to the end of the list and add an element at the end of the list
2. insertAt(element, index) – It inserts an element at the given index in a list.
In order to add an element at the given index of the list we consider three conditions as follows:
- if the index is zero we add an element at the front of the list and make it head
- If the index is the last position of the list we append the element at the end of the list
- if the index is between 0 or size – 1 we iterate over to the index and add an element at that index
3. removeFrom(index) – It removes and returns an element from the list from the specified index
In order to remove an element from the list we consider three conditions:
- If the index is 0 then we remove the head and make the next node head of the list
- if the index is size – 1 then we remove the last element from the list and make prev the last element
- if it’s in between 0 to size – 1 we remove the element by using prev and the current node
4. removeElement(element) – This method removes element from the list. It returns the removed element, or if it’s not found it returns -1.
The above method is just a modification of removeFrom(index), as it searches for an element and removes it, rather than removing it from a specified location
Let’s declare some helper methods which are useful while working with LinkedList.
1. indexOf(element) – it returns the index of a given element if the element is in the list.
In this method, we iterate over the list to find the index of an element. If it is not present in the list it returns -1 instead.
2. isEmpty() – it returns true if the list is empty.
In this method we check for the size property of the LinkedList class, and if it’s zero then the list is empty.
3. size_of_list() – It returns the size of list
3. printList() – It prints the contents of the list.
In this method, we iterate over the entire list and concatenate the elements of each node and print it.
Note: Different helper methods can be declared in the LinkedList class as required.
Now, let’s use the LinkedList class and its different methods described above.
true 10 1 undefined 10 20 30 40 50 is element removed ?50 10 20 30 40 Index of 40 3 10 20 60 30 40 is List Empty ? false 30 10 20 60 40
This article is contributed by Sumit Ghosh. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.