Linked List | Data Structure | CSE 101 Part 1
Welcome to the new series “CSE 101” where you will know some facts and important topics of computer science.This is help you to revive your knowledge again or to learn things quick!
Today we will be learning about “Linked List” ! Let’s have a look on the picture below:
Let’s play a game.You will have to start your journey from Dhaka and you will get a letter where your next location is written. So after doing this couple of times you will be able to reach your destination place!
Here is the above example, there are 7 list items containing city and a next location field. Starting at “Dhaka” the next location is 3 !
So you should go to the 3rd city which is “Chattogram” and after reaching “Chattagram” you got your next destination at 2nd city which is “Feni” !
Similarly, you will end up reaching the final destination!
So this is the concept of linked list. This is a list containing two parts:
- Information part (here city)
- Next pointer part
The list has many nodes and each of which has the above mentioned two parts !
Hope you will have the basic idea of linked list! Stay tuned for next part !
