Data Structures Linked List, Double Linked List
- 2. Linkedlist: Linkedlist is a linear collections of nodes. Node: A node contains 2 fields. data item / information Null/ Address of the next node.
- 3. Linkedlist representation: Struct node{ int item; struct node *next; };
- 4. Allocation of memory to a node: Struct node *temp; Temp=(struct node*) malloc (sizeof(struct node)); Temp is a node type pointer variable it can points to dynamic allocated memory.
- 5. Accessing the temp: Temp can be accessed by using the following code. temp->item= data temp->next= null / address of the next node
- 6. Example of linkedlist Struct node *start; start=(struct node*) malloc (sizeof(struct node));
- 7. Operations on linked list: Creation. Insertion. Deletion. Traversing. Searching.
- 8. Insertion: At the beginning of the linkedlist. In the middle of the linkedlist. At the end of the linkedlist.
- 9. Insertion at Beginning: To do so we have to follow the following code. Newnode= (struct node *)malloc(sizeof(struct node); Scanf(“%d”,&newnode->data); Newnode->next=NULL; Newnode creation
- 10. Insertion at Beginning: Inserting at the begining Head->next= newnode; newnode =head; Newnode creation
- 11. Insertion at middle: We have to go to the before position where we wanted to insert the n ode. for(i=1;i< pos -1;i++) temp =temp ->next; Newnode= (struct node *)malloc(sizeof(struct node); Scanf(“%d”,&newnode->data); Newnode->next=NULL; Newnode creation
- 12. Insertion at middle: After we reached before position where we wanted to insert the node. Newnode ->next = Temp ->next; Temp ->next= newnode; Insert node in the specified position
- 13. Insertion at end: We have to go to the end position where we wanted to insert the n ode. while (temp ->next!=NULL) temp=temp->next; Newnode= (struct node *)malloc(sizeof(struct node); Scanf(“%d”,&newnode->data); Newnode->next=NULL; Newnode creation
- 14. Insertion at end: Temp ->next= newnode; Insert node in the specified position
- 15. Deletion: At the beginning of the linkedlist. In the middle of the linkedlist. At the end of the linkedlist.
- 16. Deletion at Beginning: We have to delete the first node in the linked list. head = head ->next Deletion of First node
- 17. Deletion at middle: Moving to specific node We have to go to the before position where we wanted to insert the n ode. for(i=1;i<pos-1;i++) temp = temp ->next;
- 18. Deletion at middle: Deletion the node Deleting the specific node. newnode -> next= temp ->next; temp -> next = newnode;
- 19. Deletion at the end: Moving to last nut one node We have to go to the before position where we wanted to insert the n ode. while (temp -> next ->next!=NULL) temp =temp ->next;
- 20. Deletion at the end: Moving to last node Deleting the last node. temp ->next =NULL;
- 21. Doubly linked list: In DLL each node contains both the address of previous and next nodes.
- 22. Representation of Doubly Linked List: Struct node{ struct node *prev; int item; struct node *next; };
- 23. Operations on DLL: Creation. Insertion. Deletion. Traversing. Searching.
- 24. Circular linked List: A CLL doesn’t have starting and ending. We have 2 types of Circular linked list. 1. Circular Single Linked List. 2. Circular Double Linked List.
- 25. Circular Single LL: A single linked list can be made a circular single linked list by simply giving the address of the last node as first node.
- 26. Thank You