Every thing U can do with a Link-List + Programming_it_in_JaVa

Linked List

A linked list is a sequence of data structures, which are connected together via links.

Linked List is a sequence of links which contains items. Each link contains a connection to another link. Linked list is the second most-used data structure after array. 
Following are the important terms to understand the concept of Linked List:
  • Link − Each link of a linked list can store a data called an element.
  • Next − Each link of a linked list contains a link to the next link called Next.
  • LinkedList − A Linked List contains the connection link to the first link called First.

Linked list can be visualized as a chain of nodes, where every node points to the next node:

As per the above illustration, following are the important points to be considered.
  • Linked List contains a link element called first.
  • Each link carries a data field(s) and a link field called next.
  • Each link is linked with its next link using its next link.
  • Last link carries a link as null to mark the end of the list.
Basic Operations:
Following are the basic operations supported by a list.
  • Insertion − Adds an element at the beginning of the list.
  • Deletion − Deletes an element at the beginning of the list.
  • Display − Displays the complete list.
  • Search − Searches an element using the given key.
  • Delete − Deletes an element using the given key.

Insertion Operation:

Adding a new node in linked list is a more than one step activity.First, create a node using the same structure and find the location where it has to be inserted.

Insertion operation


Imagine that we are inserting a node B (NewNode), between A (LeftNode) and C (RightNode). Then point B.next to C −

NewNode.next −> RightNode;
It should look like this −

Insertion operation

Now, the next node at the left should point to the new node.

LeftNode.next −> NewNode;

Insertion operation

This will put the new node in the middle of the two. The new list should look like this −

Insertion operation

Similar steps should be taken if the node is being inserted at the beginning of the list. While inserting it at the end, the second last node of the list should point to the new node and the new node will point to NULL.

Deletion Operation

Deletion is also a more than one step process. First, locate the target node to be removed.

Deletion Operation


The left (previous) node of the target node now should point to the next node of the target node −

LeftNode.next −> TargetNode.next;


This will remove the link that was pointing to the target node. Now, using the following code, we will remove what the target node is pointing at.

TargetNode.next −> NULL;


We need to use the deleted node. We can keep that in memory otherwise we can simply deallocate memory and wipe off the target node completely.

Deletion Operation

Reverse Operation:

This operation is a thorough one. We need to make the last node to be pointed by the head node and reverse the whole linked list.
Reverse Operation:


First, we traverse to the end of the list. It should be pointing to NULL. Now, we shall make it point to its previous node −

Reverse Operation:
We have to make sure that the last node is not the lost node. So we'll have some temp node, which looks like the head node pointing to the last node. Now, we shall make all left side nodes point to their previous nodes one by one.
Reverse Operation:

Except the node (first node) pointed by the head node, all nodes should point to their predecessor, making them their new successor. The first node will point to NULL.
Reverse Operation:

We'll make the head node point to the new first node by using the temp node.

Reverse Operation:

The linked list is now reversed.

Java LinkedList class

Java LinkedList class uses doubly linked list to store the elements. It provides a linked-list data structure. It inherits the AbstractList class and implements List and Deque interfaces.

Doubly LinkedList:A Doubly Linked List (DLL) contains an extra pointer, typically called previous pointer, together with next pointer and data which are there in singly linked list.

Doubly LinkedList
ns
The important points about Java LinkedList are:
  • Java LinkedList class can contain duplicate elements.
  • Java LinkedList class maintains insertion order.
  • Java LinkedList class is non synchronized.
  • In Java LinkedList class, manipulation is fast because no shifting needs to be occurred.
  • Java LinkedList class can be used as list, stack or queue.

LinkedList Class Representation:


  1. public class LinkedList extends AbstractSequentialList
  2. implements List  

Constructors of Java LinkedList:

ConstructorDescription
LinkedList()It is used to construct an empty list.
LinkedList(Collection c)It is used to construct a list containing the elements of the specified collection, in the order they are returned by the collection's iterator.

Methods of Java LinkedList:

MethodDescription
void add(int index, Object element)It is used to insert the specified element at the specified position index in a list.
void addFirst(Object o)It is used to insert the given element at the beginning of a list.
void addLast(Object o)It is used to append the given element to the end of a list.
int size()It is used to return the number of elements in a list
boolean add(Object o)It is used to append the specified element to the end of a list.
boolean contains(Object o)It is used to return true if the list contains a specified element.
boolean remove(Object o)It is used to remove the first occurence of the specified element in a list.
Object getFirst()It is used to return the first element in a list.
Object getLast()It is used to return the last element in a list.
int indexOf(Object o)It is used to return the index in a list of the first occurrence of the specified element, or -1 if the list does not contain any element.
int lastIndexOf(Object o)It is used to return the index in a list of the last occurrence of the specified element, or -1 if the list does not contain any element.

Let's now see an example of LinkedList in java:
import java.util.*;
public class SuvenConsultants{
     public static void main(String args[]) {

         /* Linked List Declaration */
         LinkedList<String> linkedlist = new LinkedList<String>();

         /*add(String Element) is used for adding 
          * the elements to the linked list*/
         linkedlist.add("Android");
         linkedlist.add("Web Technology");
         

         /*Display Linked List Content*/
         System.out.println("Linked List Content: " +linkedlist);

         /*Add First and Last Element*/
         linkedlist.addFirst("Database");
         linkedlist.addLast("Java");
         System.out.println("LinkedList Content after addition: " +linkedlist);

         /*This is how to get and set Values*/
         Object firstvar = linkedlist.get(0);
         System.out.println("First element: " +firstvar);
         linkedlist.set(0, "Data Analytics");
         Object firstvar2 = linkedlist.get(0);
         System.out.println("First element after update by set method: " +firstvar2);

         /*Remove first and last element*/
         linkedlist.removeFirst();
         linkedlist.removeLast();
         System.out.println("LinkedList after deletion of first and last element: " +linkedlist);

         /* Add to a Position and remove from a position*/
         linkedlist.add(0, "Python");
         linkedlist.remove(2);
         System.out.println("Final Content: " +linkedlist); 
     }
}
Output:
Linked List Content: [Android, Web Technologies]
LinkedList Content after addition: [Database,Android, Web Technologies,Java]
First element: Database
First element after update by set method: Data Analytics
LinkedList after deletion of first and last element: [Android, Web Technologies]
Final Content: [Python, Android]

Advantages of Linked Lists

  • They are a dynamic in nature which allocates the memory when required.
  • Linked List can grow and shrink during run time.
  • Insertion and deletion operations can be easily implemented.
  • Stacks and queues can be easily executed

Disadvantages of Linked List

  • The memory is wasted as pointers require extra memory for storage.
  • No element can be accessed randomly; it has to access each node sequentially.
  • Reverse Traversing is difficult in linked list.

Want to learn more about Java?

Popular posts from this blog

MongoDB - daTa ModeLLinG Concepts: SQL - Where all to UsE ?

Comparing Bootstrap With Google's Material Design Lite : Bootstrap - ResponSive Design

MongoDB overView with Installation_procEss: SQL - Where all to UsE ?