Good links to learn linked list completely from scratch

go ask /g/, raj.

>>18631223
It's not hard mate, if you can't find this out on your own you don't stand a chance of becoming a good programmer.

>>18631223
http://www.geeksforgeeks.org/linked-list-set-1-introduction/

Linked lists are dynamically sized data structures that hold an arbitrary number of entries, and can grow and shrink when items are added or removed.

There are other ways to implement it but the easiest is to create two classes: List and Node. The list holds a reference to the first Node, and each Node has two fields: data and next. As the names imply, data is the data the node holds, and next is a reference to the next Node. e.g.

class List { Node* first; }
class Node[T] { T data; Node* next; }

To get the n-th item of a list you start from the beginning and iterate over the "next" references n times. If at any point the next is a null reference, you exit early and return null.

To count the items you iterate from the beginning to the end and return the number of iterations.

To add prepend an item to the list you create a new Node with its "next" pointing to the first element of the list, and update the List's "first" field to point to that new Node.

To add append an item, you iterate to the last Node and point its "next" to a newly-created Node.

To add an item at the n-th index, you create a new Node with its "next" pointing to the n-th item, and update the n-1'th item's "next" field to point to the newly-created item.

To remove an item, you do these in reverse.

All this is for singly-linked lists since each node has only one link. There's also double linked lists where each node also contains a reference to the previous node which you need to update when adding and removing stuff.