![Page 1: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/1.jpg)
Wellcome our presentation
![Page 2: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/2.jpg)
Our Presentation topic is LINK LISTS
![Page 3: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/3.jpg)
Name:Shaid Bin Md.Sifat
![Page 4: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/4.jpg)
Outline Introduction TRAVERSING A LINKED LIST SEARCHING A LINKED LIST Insertion Description Deletion Description Basic Node Implementation
![Page 5: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/5.jpg)
What is link list ?
Link list is the linear collection of data elements called nodes,where the linear order is given by means of pointers.
![Page 6: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/6.jpg)
![Page 7: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/7.jpg)
Type of link lists
There are mainly two type of link list
Single link listDouble link listCircular link list
![Page 8: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/8.jpg)
Single linked lists
![Page 9: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/9.jpg)
Simple node
![Page 10: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/10.jpg)
![Page 11: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/11.jpg)
Double Linked Lists
![Page 12: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/12.jpg)
Circular Lists
![Page 13: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/13.jpg)
Md.Helal sheikh
![Page 14: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/14.jpg)
14
Traversing a SLL
The following method traverses a list (and prints its elements):
public void printFirstToLast(Node here) { while (here != null) { System.out.print(here.value + " ");
here = here.next;
}}
You would write this as an instance method of the Node class
![Page 15: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/15.jpg)
15
Traversing a SLL (animation)
threetwoone
numerals
here
![Page 16: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/16.jpg)
Insertion Description
Insertion at the top of the list Insertion at the end of the list Insertion in the middle of the list
![Page 17: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/17.jpg)
Insertion at the top
Steps: Create a Node Set the node data Values Connect the pointers
![Page 18: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/18.jpg)
Insertion Description
Follow the previous steps and we get
48 17 142head //
head 93
Step 1 Step 2
Step 3
![Page 19: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/19.jpg)
Insertion at the end
Steps: Create a Node Set the node data Values Connect the pointers
![Page 20: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/20.jpg)
Insertion Description
Follow the previous steps and we get
48 17 142head //
Step 1 Step 2
Step 3
![Page 21: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/21.jpg)
Insertion in the middle
Steps: Create a Node Set the node data Values Break pointer connection Re-connect the pointers
![Page 22: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/22.jpg)
22
Inserting after (animation)
threetwoone
numerals
2.5node
Find the node you want to insert afterFirst, copy the link from the node that's already in the list
Then, change the link in the node that's already in the list
![Page 23: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/23.jpg)
Deleting from the top
Steps Break the pointer connection Re-connect the nodes Delete the node
![Page 24: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/24.jpg)
Deletion Description
4 17
head
426
4 17
head
426
4 17
head
42
![Page 25: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/25.jpg)
Md.Nazmul Hassan
![Page 26: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/26.jpg)
Deleting from the end
Steps Break the pointer connection Set previous node pointer to NULL Delete the node
![Page 27: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/27.jpg)
Deletion Description
4 17
head
426
4 17
head
426
4 176
head
![Page 28: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/28.jpg)
Deleting from the Middle
Steps Set previous Node pointer to next node Break Node pointer connection Delete the node
![Page 29: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/29.jpg)
Deletion Description
4 17 42
head
4 17
head
42
4
head
42
![Page 30: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/30.jpg)
Basic Node Implementation
The following code is written in C++:
Struct Node{
int data; //any type of data could be another structNode *next; //this is an important piece of code “pointer”
};
![Page 31: Link list presentation slide(Daffodil international university)](https://reader036.vdocuments.net/reader036/viewer/2022062302/58f068671a28abc74e8b4599/html5/thumbnails/31.jpg)
THANK YOU