Feynman Technique 2nd post (described in my post "Feynman Technique"). Today I will write about "Linked List", which is one of the topics that is asked for coding question I wrote here. Let me try to explain "Linked List" as plain as possible.
"Linked list" is a list that consists of a pair of data/information/value e.g., string or number and the next target to look at e.g., . "Linked list" may be likened to a chain (like "CCCO") where there is the first ring at the edge of the chain as a starting point, and the next ring is connected to the next ring so that the next ring can be only accessed from the first ring and so on.
For example, here we have a linked list for travel route and budget that we can use for each place as below. The first value is the location to store the data, and the second value is data stored at the first value. The third value is the next target / location to look at.
(US, 100$, Mexico) - Head
(Peru, 50$, )
(Mexico. 30$, Peru)
This linked list reprents the route from US -> Mexico -> Peru and we have the budge for each place 100$, 30$, 50$ respectively.
Reference Linked List Data Structure
Definition of Linked List
Like arrays, Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at contiguous location; the elements are linked using pointers.