Data Structure - ashish-ghub/docs GitHub Wiki

LinkedList:( Java implementation java.util.LinkedList)

https://www.geeksforgeeks.org/what-is-linked-list

Advantages of Linked Lists over arrays:

Dynamic Array.
Ease of Insertion/Deletion.

Drawbacks of Linked Lists:

Random access is not allowed. We have to access elements sequentially starting from the first node(head node). So we cannot do a binary search with linked lists efficiently with its default implementation.
Extra memory space for a pointer is required with each element of the list.
Not cache friendly. Since array elements are contiguous locations, there is locality of reference which is not there in case of linked lists.

Types of Linked Lists:

Simple Linked List – In this type of linked list, one can move or traverse the linked list in only one direction
Doubly Linked List – In this type of linked list, one can move or traverse the linked list in both directions (Forward and Backward)
Circular Linked List – In this type of linked list, the last node of the linked list contains the link of the first/head node of the linked list in its next pointer and the first/head node contains the link of the last node of the linked list in its prev pointer

Java Collection on LinkedList a) java.util.LinkedList (doubly linkedlist) b) LinkedHashMap : Hash table and linked list implementation of the Map interface, with predictable iteration order. c) LinkedHashSet via LinkedHashMap it uses it (main implementation is there in LinkedList & LinkedHashMap)

https://docs.oracle.com/javase/8/docs/api/java/util/LinkedHashMap.html

source code java util: