LinkedLists in Java

1) Print Elements of Linked List



2) Reverse LinkedList



3) Delete a given Element of a LinkedList



4) Delete kth Element from headNode of  a LinkedList



5) Delete kth Element from tailNode of  a LinkedList



6) Detect if a LinkedList contains a Cycle



7) Remove an Element from a DoublyLinkedList



8) Merge Elements of a DoublyLinkedList



9) Create a Cache such that the Elements can be added at Head and removed from Tail, in O(1)