Download to read offline
![Representation of the Record using Linked List
struct student
{
int id;
char name[20];
int sem;
struct student link;
};
typedef struct student *NODE;](https://image.slidesharecdn.com/dokumen-231210090341-39c86097/85/dokumen-tips_linked-list-ppt-5584a44be6115-pptx-50-320.jpg)
dokumen.tips_linked-list-ppt-5584a44be6115.pptx
- 2. DATASTRUCTURE DATRUCTURE IS THEWAY OF ORGANIZING ALL DATA ITEMS IN ORDER THAT NOT ONLY ELEMENTS TO BE STORED BUT ALSO THE RELATION BETWEEN THE ELEMENTS
- 3.
- 4. Linked List What arethe problems with Arrays - Size is fixed -Array Items are stored contiguously -Insertions and deletion at particular position is complex Why Linked list ? -Size is not fixed -Data can be stored at any place -Insertions and deletions are simple and faster
- 5. What is LinkedList? A linked list is a collection of nodes with various fields It contains data field and Address field or Link field Info field Link Field/ Address Field Pointer to the first node
- 6. Linked List Types SinglyLinked list Circular singly linked list Doubly linked lists Circular doubly linked lists
- 7.
- 8. Graphical Representation 10 1000 1000 2000 2000 15 4000 20 4000 CircularSingly Linked List Last node contains the address of the first node First
- 9. Doubly Linked list Containsthe address of previous node and next node NULL 2000 3000 1000 10 15 20 2000 1000 2000 NULL 3000 First
- 10. Circular Doubly Linkedlist Contains the address of first node and last node 3000 2000 3000 1000 10 15 20 2000 1000 2000 1000 3000 First
- 11. Representation of SinglyLinked list struct node { int info; struct node *link }; typedef struct node *NODE; Meaning of this: A node is of the type struct and contains info field and link filed
- 12. What is typedef? typedef is a keyword in the C Language used to give the new name to data types The intent is to make it easier for programmers Example typedef int x; Later on you can use x as a data type x a, b; Means a and b are variables of the type integer
- 13. Graphical Representation 10 1000 1000 2000 2000 15 NULL 20 4000 Operationson Singly Linked List First Insert Delete Display the contents
- 14. Allocation of memoryto newnode newnode =( NODE ) malloc (sizeof(struct node)); It Returns address of the location with piece of memory of the size struct. That is for information field and address field
- 15. Algorithm to Insertan Element from the front 1 temp=allocate memory 2 temp(info)=item; 3 link(temp)=first; 4 call temp as first 5 temp <- newnode 6 return first; temp 30 Temp node with item NULL NULL NULL
- 16. 10 1000 1000 2000 2000 15 NULL 20 4000 Operations onSingly Linked List Insert from the front First temp temp->link=first,
- 17. 10 1000 1000 2000 2000 15 NULL 20 4000 Operations onSingly Linked List Insert from the front First first=temp
- 18. Algorithm to Displaythe content // Algorithm Display if (first==NULL) write list empty return; Write “ Contents of the List ” temp=first While(temp!=NULL) { write (info(temp)) temp=link(temp) }
- 19. C Function toInsert an Element from the front Insertfront(NODE first int item) { NODE temp; temp=(NODE) malloc(sizeof(struct node)); temp->info=item; temp->link=NULL ; temp->link=first; first=temp; return(temp); }
- 20. Algorithm to Deletefrom the front 1 if (first==NULL) 2 Write list empty and return first 3 temp=first 4 first=link(first) 5 free(temp) 6 return(first)
- 21. C Function toDelete the element from the front NODE deletefront(NODE first) { if (first==NULL) { printf(List is empty..n”); return first; } temp=first; first=first->link; printf(“ The ietm deleted is %d”,temp->info); free(temp); return(first); }
- 22. 10 1000 1000 2000 2000 15 NULL 20 4000 Operations onSingly Linked List Delete from the front Temp/ First temp=first
- 23. 10 1000 1000 2000 2000 15 NULL 20 4000 Operations onSingly Linked List Delete from the front First temp temp=first, first=first->link
- 24. 1000 2000 2000 15 NULL 20 Operationson Singly Linked List Delete from the front First
- 25. Stack Using LinkedList CONCEPT : LIFO Inserting an element from front and deleting an element from front is nothing but STACK
- 26. 30 Null top 3000 Push item30 S T A C K L I N K E D L I S T
- 27.
- 28.
- 29.
- 30.
- 31.
- 32. Inserting an Elementfrom the rear and deleting An element from the front is nothing but Q Implementation of Q using Linked List
- 33.
- 34.
- 35.
- 36.
- 37.
- 38.
- 39. 20 front Deleting 20 2000 temp=front front=front->link free(temp) rear 30 3000 2000 1000 40Null 3000 Delete Operation
- 40.
- 41.
- 42.
- 43. 10 1000 1000 2000 2000 15 NULL 20 4000 Searching anItem in a Singly Linked List first Cur=first Pos=1; while(cur!=NULL && item!=cur->info) cur=cur->link; pos++; key=20 cur Cur->info=10
- 44. 10 1000 1000 2000 2000 15 NULL 20 4000 Searching anItem in a Singly Linked List key =30 First Cur=first Pos=1; while(cur!=NULL && item!=cur->info) cur=cur->link; pos++; Cur Cur->info = 15 Key=30
- 45. 10 1000 1000 2000 2000 15 NULL 20 4000 Searching anItem in a Singly Linked List First Cur=first Pos=1; while(cur!=NULL && item!=cur->info) cur=cur->link; pos++; Cur Now Item = 20 , key found at position =3
- 46. C Function tosearch an Item in the list NODE search(NODE first, int key) { NODE cur; int pos; if(first==NULL) { printf(“ List Empty Search Not Possible…..n”); return; } Cur=first; pos=1; while( cur != NULL && key!=cur->info) { cur=cur->link;
- 47. If(cur==NULL) printf(“ Item notfound…n”); else printf(“ Item found at position .. %d”,pos); }
- 48. Inserting an Elementat any Position 10 20 2000 2000 NULL
- 49. 21 ANIL 03 2000 200022 sunil 3 NULL first Each Student Record in a Node 1000
- 50. Representation of theRecord using Linked List struct student { int id; char name[20]; int sem; struct student link; }; typedef struct student *NODE;