Downloaded 17 times
1. 6 doubly linked list
This document discusses doubly linked lists. It begins by explaining some of the limitations of circular singly linked lists, such as the inability to easily traverse backwards. Doubly linked lists are then introduced as a solution, with each node containing pointers to both the next and previous nodes. The key operations on doubly linked lists like insertion at the beginning, end, and middle as well as deletion at the beginning, end, and middle are described algorithmically. Traversal in both the forward and backward directions is also covered. Code examples are provided to demonstrate creating and manipulating doubly linked lists.
More Related Content
![Data Structures - Lecture 9 [Stack & Queue using Linked List]](https://cdn.slidesharecdn.com/ss_thumbnails/lecture-9stackqueueusinglinkedlist-150219032411-conversion-gate02-thumbnail.jpg?width=640&height=640&fit=bounds)
Similar to 1. 6 doubly linked list
More from P. Subathra Kishore, KAMARAJ College of Engineering and Technology, Madurai
1. 6 doubly linked list
- 1. DATA STRUCTURES Dr. P.Subathra subathrakishore@yahoo.com Professor Dept. of Information Technology KAMARAJ College of Engineering & Technology (AUTONOMOUS) Madurai Tamil Nadu India
- 2. CS8391 – DATASTRUCTURES ONLINE CLASSES – CLASS NO. 9 08.09.2020 (02:00 PM – 03:00 PM)
- 3.
- 4. WHAT IS WRONGWITH CIRCULAR SINGLY LINKED LIST…??
- 5. VISIT THE PREVIOUSNODES WITH EASE ..???!!! BACKWARD TRAVERSAL…..???!!! WHAT IS WRONG WITH CIRCULAR SINGLY LINKED LIST…??
- 6. • Is thatAnnoying….??? • No Worries MAN…!!! WHAT IS WRONG WITH CIRCULAR SINGLY LINKED LIST …??
- 7.
- 8. Motivation • Doubly linkedlists are useful for playing video and sound files with “rewind” and “instant replay” • They are also useful for other linked data which require “rewind” and “fast forward” of the data
- 9. Node of aDoubly Linked List • NODE – Data Field – Link / Pointer Fields • HEAD • TAIL • NULL Pointers
- 10.
- 12.
- 13. 1001 1002 10031004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050
- 14. 1001 1002 10031004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1003 head 1030 tail
- 16. SN Operation Description 1Insertion at beginning Adding the node into the linked list at beginning. 2 Insertion at end Adding the node into the linked list to the end. 3 Insertion after specified node Adding the node into the linked list after the specified node. 4 Deletion at beginning Removing the node from beginning of the list 5 Deletion at the end Removing the node from end of the list. 6 Deletion of the node having given data Removing the node which is present just after the node containing the given data. 7 Searching Comparing each node data with the item to be searched and return the location of the item in the list if the item found else return null. 8 Traversing Visiting each node of the list at least once in order to perform some specific operation like searching, sorting, display, etc. Operations on a Doubly Linked List
- 17.
- 18. EMPTY LIST struct node* head = NULL; struct node * head = NULL; Operations on a Doubly Linked List NULL head tail NULL
- 19. CREATING A LIST •Creating the FIRST Node and Attaching it to the List struct node * temp = (node *) malloc (sizeof (struct node)); tempnext = NULL; temprev=NULL; Operations on a Doubly Linked List Data fieldPrev Link temp 1005 Next Link NULL NULL head NULL tail NULL
- 20. CREATING A LIST •Creating the FIRST Node and Attaching it to the List struct node * temp = (node *) malloc (sizeof (struct node)); tempnext = NULL; temprev=NULL; head = temp; tail = temp; Operations on a Doubly Linked List Data fieldPrev Link temp 1005 Next Link NULL NULL 1005 head 1005 tail
- 21. CREATING A LIST •Creating the FIRST Node and Attaching it to the List struct node * temp = (node *) malloc (sizeof (struct node)); tempnext = NULL; temprev=NULL; head = temp; tail = temp; tempdata=777; Operations on a Doubly Linked List Data fieldPrev Link temp 1005 Next Link NULL 777 NULL 1005 head 1005 tail
- 23. https://www.youtube.com/watch?v=DsjigShQY_ c&list=PLqer4ixaRRQLvGA1yvg2trDJ4B_fbmDzs& index=31 OPERATIONS ON ADOUBLY LINKED LIST : CREATING A LIST
- 24.
- 25. struct node { int data;// Data node *prev; // A reference to the //previous node node *next; // A reference to the next //node }; node *head; // points to first node node *tail; // points to first last node head = NULL; tail = NULL; OPERATIONS ON A DOUBLY LINKED LIST : CREATING A LIST (code)
- 26.
- 27.
- 29. https://www.youtube.com/watch?v=I9FyNeaBs 0w OPERATIONS ON ADOUBLY LINKED LIST : INSERT FIRST
- 30. void insertFirst(int d) { //Creating new node node *temp; temp = new node(); temp->data = d; temp->prev = NULL; temp->next = front; // List is empty if(front == NULL) end = temp; else front->prev = temp; front = temp; } OPERATIONS ON A DOUBLY LINKED LIST : INSERT FIRST
- 31.
- 33. https://www.youtube.com/watch?v=u0gAg1aeX nw&list=PLqer4ixaRRQLvGA1yvg2trDJ4B_fbmDz s&index=29 OPERATIONS ON ADOUBLY LINKED LIST : INSERT LAST
- 34. void insertLast(int d) { //create new node node *temp; temp = new node(); temp->data = d; temp->prev = end; temp->next = NULL; // if list is empty if(end == NULL) front = temp; else end->next = temp; end = temp; } OPERATIONS ON A DOUBLY LINKED LIST : INSERT LAST
- 35.
- 37. • Insert anode New before Cur (not at front or rear) 10 7020 55 40Head New Cur New->next = Cur; New->prev = Cur->prev; Cur->prev = New; (New->prev)->next = New; Tail OPERATIONS ON A DOUBLY LINKED LIST : INSERT BEFORE
- 38. • Insert anode New after Cur (not at front or rear) 10 7020 55 40Head New Cur New->prev = Cur; New->next = Cur->next; Cur->next = New; (New->next)->prev = New; Tail OPERATIONS ON A DOUBLY LINKED LIST : INSERT AFTER
- 39. https://www.youtube.com/watch?v=h3u1sQgKT G4&list=PLqer4ixaRRQLvGA1yvg2trDJ4B_fbmDz s&index=30 OPERATIONS ON ADOUBLY LINKED LIST : INSERT MIDDLE
- 40.
- 41.
- 42. OPERATIONS ON ADOUBLY LINKED LIST : DELETE FIRST
- 43. https://www.youtube.com/watch?v=fYOAk4QL3 Lo&list=PLqer4ixaRRQLvGA1yvg2trDJ4B_fbmDzs &index=32 OPERATIONS ON ADOUBLY LINKED LIST : DELETE FIRST
- 44.
- 46. https://www.youtube.com/watch?v=tt3v2u6fIs U&list=PLqer4ixaRRQLvGA1yvg2trDJ4B_fbmDzs &index=33 OPERATIONS ON ADOUBLY LINKED LIST : DELETE LAST
- 47.
- 48. OPERATIONS ON ADOUBLY LINKED LIST : DELETE MIDDLE
- 49. Deleting a Node •Delete a node Cur (not at front or rear) (Cur->prev)->next = Cur->next; (Cur->next)->prev = Cur->prev; delete Cur; 10 7020 5540 Head Cur Tail
- 50. https://www.youtube.com/watch?v=VL3- SVonQz0&list=PLqer4ixaRRQLvGA1yvg2trDJ4B_f bmDzs&index=34 OPERATIONS ON ADOUBLY LINKED LIST : DELETE MIDDLE
- 51. void Doubly_Linked_List ::delete_node(node *n) { // if node to be deleted is first node of list if(n->prev == NULL) { front = n->next; //the next node will be front of list front->prev = NULL; } // if node to be deleted is last node of list else if(n->next == NULL) { end = n->prev; // the previous node will be last of list end->next = NULL; } else { //previous node's next will point to current node's next n->prev->next = n->next; //next node's prev will point to current node's prev n->next->prev = n->prev; } //delete node delete(n); } OPERATIONS ON A DOUBLY LINKED LIST : DELETE MIDDLE
- 52. OPERATIONS ON ADOUBLY LINKED LIST : FORWARD TRAVERSAL void forwardTraverse() { node *trav; trav = front; while(trav != NULL) { cout<<trav->data<<endl; trav = trav->next; } }
- 53. OPERATIONS ON ADOUBLY LINKED LIST : BACKWARD TRAVERSAL void backwardTraverse() { node *trav; trav = end; while(trav != NULL) { cout<<trav->data<<endl; trav = trav->prev; } }
- 54.
- 55.