Linked List in Java - Collections Framework- DSA

Gist:

A Linked list is dynamic array where a group of object can be stored while following the insertion order and allow duplicates, the 2 type of linked list is singly and double linked lists, the default one is single linked list where the elements can be traversed only in forward direction this is because unlike array here the elements are stored at random locations and only the node of each element knows the address of the next element. A simple example would be our circut board here a point X may be connection to Y and Y connectioned to pont Z here the insertion order is preserved and we can know the next point only by following the signals from the previous point.

Same as the example but in Linked list each element has 2 parts in singly linked list where 1 part is the node with the adress to the next node and the other which is the actua data of that element like a post letter the envelop has the address and inside the contents. but in doubly linked list there are 3 parts 2 of them are nodes which has the address of previous and next element and the other one is the actual data of that element.

The insertion or deletion are in constant time so compared to arrayList the mega process will be avoided. 

Hierarchical order

Type of constructors

• Empty argument constructor or the default constructor is the same as invoking any other objectobjectobjectobject here a new linked list object will be careated, do note that there is no scope for reserving memory for the number of elements as we add new element the size is maintained dynamically a new Li ked list is empty list. 

  LinkedList = new LinkedLis() ;

• Conversion of other Collections like ArrayList, Vector, etc...to an linked List is possible with the following constructor.

• LinkedList arraysFromVector = new LinkedList( VariableNameOfTheCollection );


• //here any collection will be converted into an Linkedlist

Important Points

• By default an empty LinkedList is created. 
• Is Dynamically Growable and Shrinkable. 
• Heterogeneous Objects are allowed.
• There is no initial capacity 
• No load factor is applicable here. 
• Order of insertion is preserved
• We can also use generic data-type such that the array acts like a homogenous.
• Random acess interface is not implemented. 
• Ideal if the operations are Insertion or deletion. 

Implementing Interfaces

• Serializable
• Cloneable
• Iterable <E>
• Collection <E>

Methods available to only the Arraylist object. 

• .addFirst(Element) -> adds the element in the front of the ArrayList. 
• .addLast(Element) -> add an element in the last part of the ArrayList. 
• getFirst() --> returns the Object at the front of the Linked List. 
• getLast() --> returns the last object in the linked list.
• removeFirst() -> returns the object in the first and removes it from the linked list
• removeLast() --> returns the last objects and removes the object from the linked list. 

Pros	Cons
Ideal if insertion or deletion operations are more.	Worst if there are lots of search operations as it needs to iterate through all the other elements.
By default the elements can be traversed through forwad direction.	Java LinkedList class is non-synchronized.
Can hold duplicate elements.	Does not implement random access interface.
Can hold null values.
The process of insertion or deletion is simple and fast.