Downloaded 30 times
More Related Content
Similar to Link list presentation slide(Daffodil international university)
Link list presentation slide(Daffodil international university)
- 1.
- 2. Our Presentation topic isLINK LISTS
- 3.
- 4. Outline Introduction TRAVERSINGA LINKED LIST SEARCHING A LINKED LIST Insertion Description Deletion Description Basic Node Implementation
- 5. What islink list ? Link list is the linear collection of data elements called nodes,where the linear order is given by means of pointers.
- 7. Type of linklists There are mainly two type of link list Single link list Double link list Circular link list
- 8.
- 9.
- 11.
- 12.
- 13.
- 14. 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
- 15. 15 Traversing a SLL(animation) threetwoone numerals here
- 16. Insertion Description Insertionat the top of the list Insertion at the end of the list Insertion in the middle of the list
- 17. Insertion at thetop Steps: Create a Node Set the node data Values Connect the pointers
- 18. Insertion Description Followthe previous steps and we get 48 17 142head // head 93 Step 1 Step 2 Step 3
- 19. Insertion at theend Steps: Create a Node Set the node data Values Connect the pointers
- 20. Insertion Description Followthe previous steps and we get 48 17 142head // Step 1 Step 2 Step 3
- 21. Insertion in themiddle Steps: Create a Node Set the node data Values Break pointer connection Re-connect the pointers
- 22. 22 Inserting after (animation) threetwoone numerals 2.5node Findthe node you want to insert after First, 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
- 23. Deleting from thetop Steps Break the pointer connection Re-connect the nodes Delete the node
- 24. Deletion Description 4 17 head 426 417 head 426 4 17 head 42
- 25.
- 26. Deleting from theend Steps Break the pointer connection Set previous node pointer to NULL Delete the node
- 27. Deletion Description 4 17 head 426 417 head 426 4 176 head
- 28. Deleting from theMiddle Steps Set previous Node pointer to next node Break Node pointer connection Delete the node
- 29. Deletion Description 4 1742 head 4 17 head 42 4 head 42
- 30. Basic Node Implementation Thefollowing code is written in C++: Struct Node { int data; //any type of data could be another struct Node *next; //this is an important piece of code “pointer” };
- 31.