LinkedList explained with program and concept explanation .
When someone says a linked list means they were talking about singly linked list . In order to understand it , think of every node as a container having two values . First one is their own value and second one is address of next node .
When you talk about Array data structure then their memory localised in continue manner , while in linked list you can take a memory block any where you want and connect that with your reference address .
In above diagram , there is four nodes and connected through their memory address referencing . As in first node “35” is its value and “1001” is address of next node for referencing . While 1000 is its own memory address .
Let us Implement it in a C++ Program : —
