![SELF REFERENTIAL STRUCTURES
struct Complex
{
int real;
int imaginary;
}
In main()
Complex c[3];
3
4
-5
7
2
5
……
65004
65005
65006
65007
65008
65009
65010
65011
65012
65013
65014
65015
……
c[0]
c[1]
c[2]
c[0]= 3+4i
c[1]= -5+7i
c[2]= 2+5i](https://image.slidesharecdn.com/stackqueuelinkedlist-220707092852-e4b0beff/85/Stack-Queue-Linked-List-pptx-32-320.jpg)
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 Stack, Queue, Linked List.pptx
Stack, Queue, Linked List.pptx
- 1. Prof. Sonali Mhatre DATA STRUCTURESAND ANALYSIS
- 2. Array List Tuple Vector Data Frame Stack Queue Linked List DATA STRUCTURES
- 3. STACK AS ADATA STRUCTURE
- 4. STACK AS ADATA STRUCTURE
- 5. STACK AS ADATA STRUCTURE
- 6. STACK AS ADATA STRUCTURE
- 7. 30 20 10 STACK AS ADATA STRUCTURE Top 2 1 0
- 8. STACK AS ADATA STRUCTURE
- 9. LIFO (LastIn First Out) Push Pop STACK AS A DATA STRUCTURE
- 10. QUEUE AS DATASTRUCTURE
- 11. FIFO (FirstIn First Out) Enqueue Deque QUEUE AS DATA STRUCTURE
- 12.
- 13. CIRCULAR QUEUE 10 2030 F=0 R=2 10 20 30 40 50 F=0 R=4 10 20 30 40 F=0 R=3 Queue is Full
- 14. CIRCULAR QUEUE 20 3040 50 F=1 R=4 60 30 40 50 F=2 R=0 60 20 30 40 50 F=1 R=0 Queue is Full
- 15. CIRCULAR QUEUE 60 7030 40 50 F=2 R=1 60 70 80 40 50 F=3 R=2 60 70 40 50 F=3 R=1 Queue is Full Queue is Full
- 16. CIRCULAR QUEUE 60 7080 50 F=4 R=2 60 70 80 90 50 F=4 R=3 Queue is Full 60 70 80 90 F=0 R=3 60 70 80 90 100 F=0 R=4 Queue is Full
- 17. int isFull(struct Queue* q) { if(((abs(q->front-q->rear))==SIZE-1) || q- >rear==q->front-1) return 1; else return 0; } QUEUE ISFULL
- 18. CIRCULAR QUEUE F=-1 R=-1 Queue isempty 10 F=0 R=0 F=1 R=0 Queue is empty? Queue is full? 20 R=1 F=1
- 19.
- 20. CIRCULAR QUEUE Queue isEmpty?? Queue is Full?? R=1 F=0 30 R=2 F=2 40 R=3 F=3 50 R=4 F=4
- 21.
- 22.
- 23. Array Implementation Insert and Sort Remove and Rearrange Linked List Implementation PRIORITY QUEUE IMPLEMENTATIONS
- 24.
- 25. DOUBLE ENDED QUEUE R=-1 F=-1 1020 R = 5 F = 4
- 26. 30 10 20 R= 5 F = 3 Insert Element at Front End 40 30 10 20 F = 2 R = 5 50 40 30 10 20 F = 1 R = 5 DOUBLE ENDED QUEUE
- 27. Insert Element atFront End 60 50 40 30 10 20 F = 0 R = 5 60 50 40 30 10 20 70 F = 9 R = 5 60 50 40 30 10 20 11 22 80 70 F = 6 R = 5 Queue is Full DOUBLE ENDED QUEUE
- 28. DOUBLE ENDED QUEUE R=-1 F=-1 1020 R = 5 F = 4
- 29. DOUBLE ENDED QUEUE 1020 30 R = 6 F = 4 Insert Element at Rear End 10 20 30 40 R = 7 F = 4 10 20 30 40 50 60 R = 9 F = 4
- 30. 70 10 2030 40 50 60 R = 0 F = 4 Insert Element at Rear End DOUBLE ENDED QUEUE 70 80 10 20 30 40 50 60 R = 1 F = 4 70 80 90 11 10 20 30 40 50 60 R = 3 F = 4 Queue is Full
- 31. Insertions andDeletions from both ends I/P restricted Input from only one end and Output from either end O/P restricted Input from either end and Output from only one end DOUBLE ENDED QUEUE
- 32. SELF REFERENTIAL STRUCTURES structComplex { int real; int imaginary; } In main() Complex c[3]; 3 4 -5 7 2 5 …… 65004 65005 65006 65007 65008 65009 65010 65011 65012 65013 65014 65015 …… c[0] c[1] c[2] c[0]= 3+4i c[1]= -5+7i c[2]= 2+5i
- 33. struct Complex { int real; intimaginary; struct Complex * next } In main() Complex *c; c->next; c->next->next; SELF REFERENTIAL STRUCTURES c 3+4i next -5+7i next 2+5i next NULL
- 34.
- 35. Self ReferentialStructure LINKED LIST 10 next 20 next 30 next 40 NULL
- 36. 10 next 20 next 30next 40 NULL LINKED LIST tmp tmp tmp tmp tmp = tmp ->next
- 37. 10 next 20 next 30next 40 NULL LINKED LIST Start/First tmp tmp tmp tmp
- 38. 10 next 20 next 30next 40 NULL LINKED LIST start s
- 39. 10 next 20 next 30next 40 NULL LINKED LIST (ADD AT BEGINNING) start s 50 NULL nn next start
- 40. 10 next 20 next 30next 40 NULL LINKED LIST (ADD AT END) start t 50 NULL nn s t t t next
- 41. struct Node n;//Static struct Node * n = (struct Node *) malloc (sizeof (struct Node)); //Dynamic MALLOC (DYNAMIC MEMORY ALLOCATION)
- 42.
- 43. 10 next 20 next 30next 40 next LINKED LIST(ADD AT A POSITION) start t s 100 NULL nn t t 50 NULL Position=4 next Count=1 Count=2 Count=3
- 44. 10 next 20 next 30next 40 next LINKED LIST(ADD AT A POSITION) start t s 100 NULL nn t t 50 NULL Position=4 next Count=1 Count=2 Count=3 ?
- 45.
- 46. 10 next 20 next 30next 40 next LINKED LIST(ADD BEFORE) start t s 100 NULL nn t t 50 NULL Before = 40 t pt null
- 47. 10 next 20 next 30next 40 next LINKED LIST(ADD BEFORE) start t s 100 NULL nn t t 50 NULL Before = 40 next t pt pt pt
- 48. 10 next 20 next 30next 40 next LINKED LIST (ADD BEFORE) start t s 100 NULL nn t t 50 NULL Before = 40 next t pt pt pt
- 49.
- 50. 10 next 20 next 30next 40 next LINKED LIST (ADD AFTER) start t s 100 NULL nn t t 50 NULL After = 30 next
- 51.
- 52. 10 next 20 next 30next 40 NULL LINKED LIST (DELETE BEGINNING) start s s start s=s->next;
- 53. 10 next 20 next 30next 40 next LINKED LIST (DELETE END) start t s t t 50 NULL t pt pt pt pt t pt->next=NULL; NULL
- 54.
- 55. 10 next 20 next 30next 40 next LINKED LIST (DELETE IN BETWEEN NODE) start t s t t 50 NULL pt pt pt->next=t->next; Delete = 30
- 56. 10 next 20 next 30NULL LINKED LIST (REVERSING A LIST) start t s nt nnt t nt nnt NULL s NULL while(nt!=NULL) next t nt s start
- 57.
- 58. 10 next 20 next 30next 40 NULL CIRCULAR LINKED LIST start s next
- 59. 10 next 20 next 30next 40 NULL CIRCULAR LINKED LIST (ADD AT BEGINNING) start s next 100 NULL nn next l start s
- 60. if(s==NULL) { s=nn; s->next=s; } else { struct Node *l=getLast(s); nn->next=s; l->next=nn; s=nn; CIRCULAR LINKED LIST (ADD AT BEGINNING)
- 61. 10 next 20 next 30next 40 NULL CIRCULAR LINKED LIST (ADD AT END) start s next 100 NULL nn next l
- 62. if(s==NULL) { s=nn; s->next=s; } else { struct Node *l=getLast(s); nn->next=s; l->next=nn; } CIRCULAR LINKED LIST (ADD AT END)
- 63. 10 next 20 next 30next 40 CIRCULAR LINKED LIST (DELETE BEGINNING) start s next l start s
- 64. struct Node *l=getLast(s); if(s==l) s=NULL; else { l->next=s->next; s=s->next; } CIRCULAR LINKED LIST (DELETE BEGINNING)
- 65. 10 next 20 next 30next 40 CIRCULAR LINKED LIST (DELETE END) start s next l t t t
- 66. struct Node *l=getLast(s); if(s==l) s=NULL; else { struct Node * t=s; while(t->next!=l) t=t->next; t->next=s; } CIRCULAR LINKED LIST (DELETE END)
- 67. Double pointer Pointer to previous Node Pointer to Next Node struct Node { int a; struct Node * prev; struct Node * next; } DOUBLY LINKED LIST a prev next
- 68. DOUBLY LINKED LIST NULL100 next prev 200 next prev 300 next prev 400 next prev 500 NULL start
- 69. DOUBLY LINKED LIST(ADD AT BEGINNING) NULL 100 next prev 200 next prev 300 next prev 400 next prev 500 NULL start NULL 1000 NULL nn next prev s start s
- 70.
- 71. DOUBLY LINKED LIST(ADD AT END) NULL 100 next prev 200 next prev 300 next prev 400 next prev 500 NULL start NULL 1000 NULL nn s t t t t t next prev
- 72. if(s==NULL) s=nn; else { struct Node *t; t=s; while(t->next!=NULL) t=t->next; t->next=nn; nn->prev=t; } DOUBLY LINKED LIST (ADD AT END)
- 73. NULL 100 next prev200 next prev 300 next prev 400 NULL start NULL 1000 NULL s t t Position = 3 Count = 1 Count = 2 next prev DOUBLY LINKED LIST (ADD AT A POSITION)
- 74.
- 75. NULL 100 next prev200 next prev 300 next prev 400 NULL start NULL 1000 NULL s t t Before = 300 next prev DOUBLY LINKED LIST (ADD BEFORE) t pt=NULL pt pt
- 76. if(pt==NULL) { nn->next=t; t->prev=nn; s=nn; } DOUBLY LINKED LIST(ADD BEFORE) else { pt->next=nn; t->prev=nn; nn->next=t; nn->prev=pt; }
- 77. Without pt ???????? DOUBLYLINKED LIST (ADD BEFORE)
- 78. NULL 100 next prev200 next prev 300 next prev 400 NULL start NULL 1000 NULL s t t Before = 300 next prev DOUBLY LINKED LIST (ADD BEFORE) t
- 79.
- 80. NULL 100 next prev200 next prev 300 next prev 400 NULL start NULL 1000 NULL s t t After = 200 next prev DOUBLY LINKED LIST (ADD AFTER)
- 81.
- 82. NULL 100 next prev200 next prev 300 next prev 400 next prev 500 NULL start DOUBLY LINKED LIST (DELETE BEGINNING) s NULL s start
- 83. s->next->prev=NULL; s=s->next; DOUBLY LINKED LIST(DELETE BEGINNING)
- 84. NULL 100 next prev200 next prev 300 next prev 400 NULL start s DOUBLY LINKED LIST (DELETE END) t pt=NULL t pt t pt t pt NULL
- 85.
- 86. Without pt ???????? DOUBLYLINKED LIST (DELETE END)
- 87. NULL 100 next prev200 next prev 300 next prev 400 NULL start s DOUBLY LINKED LIST (DELETE AT A POSITION) t pt=NULL t pt t pt Position = 3 Count = 1 Count = 2
- 88.
- 89. NULL 100 next prev200 next prev 300 next prev 400 NULL start s DOUBLY LINKED LIST (DELETE AFTER) t t After = 200
- 90.
- 91. NULL 100 next prev200 next prev 300 next prev 400 NULL start s DOUBLY LINKED LIST (DELETE BEFORE) t pt=NULL t pt t pt Before = 400 ppt=NULL ppt pt ppt
- 92.
- 93. Array Linked List Dataelements are stored in contiguous locations in memory. New elements can be stored anywhere and a reference is created for the new element using pointers. Array elements can be accessed randomly using the array index. Random accessing is not possible in linked lists. The elements will have to be accessed sequentially. Insertion and Deletion operations are costlier since the memory locations are consecutive and fixed. Insertion and Deletion operations are fast and easy in a linked list. Memory is allocated during the compile time (Static memory allocation). Memory is allocated during the run-time (Dynamic memory allocation).