Linked List : All Operations

So, there is this one topic, that I'm myself not yet understood fully, but here I have tried to combine all the operations on the Linked List at a single program and that too making it short & simple. Well making this program was real headache but my dear friend NJN1RJ (what he calls him), was very supportive and helpful to make this program full, otherwise it would still be in my thought's only.

Anyway to tell you what is happening in the program, first I need to understand it, and I am going to tell you what have I learned till now, from the linked list. As the name suggests, the linked list is an array that is distributed over different location. Unlike Array, i.e., stored in a contiguous manner, Link List stores data in non contiguous manner and hence is more efficient in many ways than array, well to be fair, it is a little complex to understand but once it is understood then there is probably anything you cannot do with link list. To be honest, I am still lacking the knowledge how the hell, does this code runs, and how the DYNAMIC ALLOCATION works, but there is a way, tomorrow my Friend, NJN1RJ is going to explain me how does this code and it's code works, well then I am just a blog away from all to share my insight's of Link List with you all.

So be prepared for our next blog, where you will understand the concept of Linked List in depth, literally. So till then here is my code, that I made with help of my Friend, NJN1RJ. Here is the link of my GITHUB Account. Make sure to follow me and check all my repositories, well "ONLY FOR EDUCATIONAL PURPOSES", but you can use it for learning also.

GITHUB

Instagram

Friend Instagram (whether he likes it or not)

So till next time, stay yourself, and try and be unique, all are still the same.