Here is a Java implementation of a Singly linked list. So you can see how the real functions of a linked list work.
🧵 To insert a value at last.
🧵 To insert a value at some given index.
🧵 To traverse in Linked List.
🧵 To get size of singly linked list.
🧵 To delete last Node.
🧵 To delete any node at a given index.
🧵 To find center of a Linked list.
🧵 To get a whole node of a particular index.
🧵 To check the presence of an element in Linked List.
🧵 Iterator to iterate.
You too can Contribute 🧠