Question

I need help and tied to the requirements please. Exactly part B and D.

2. (20pts) Consider the following linked list (LL is pointing to the sentinel node): 2. (20 points) Consider the following linked list (LL is pointing to the sentinel node) NULL Assume each node is a struct node(int data; struct node 'next) (a) what will be printed by the following statement? printf("%d %d\n",LL-> next-> next-> data, LL-> next->data); Part A: What will be printed by the following statements? printf(%d %d\n", LL->next->nextdata,LL->next->data); 4 6 Part B: Write some code to delete the last node of the list, without using any loops or conditional statements. Be sure to free the node's memory too. Part C: Write some C code to create a new node, and point to it with a variable named "new". struct node *new-malloc(sizeof(struct node)); Part D: Write some C code to insert that new node between the 6 and the 4 (again, without any loops or conditionals)

Answer 1

code:

#include<stdio.h>

//Declaring the structure of the node
struct node
{
   int data;
   struct node *next;
};

//prints the list
void printlist(struct node *temp)
{
   while(temp != NULL)
   {
       printf("%d ",temp->data);
       temp=temp->next;
   }
   printf(" ");
}

int main()
{
   struct node * LL=NULL,*temp=NULL;
   //Creating the given list
   LL=malloc(sizeof(struct node));  
   LL->data=0;
   LL->next=malloc(sizeof(struct node));
   LL->next->data=6;
   LL->next->next=malloc(sizeof(struct node));
   LL->next->next->data=4;
   LL->next->next->next=malloc(sizeof(struct node));
   LL->next->next->next->data=1;
   LL->next->next->next->next=NULL;
  
  
   printf("Initially the given list ");
   printlist(LL);
   printf("printed by the statement in 'a' ");
   printf("%d %d ",LL->next->next->data,LL->next->data);
  
   //Deleting the last node of the list
   LL->next->next->next=NULL;
   free(LL->next->next->next);
   printf("After Deleting the last node of the list ");
   printlist(LL);
  
   //Creating new node
   struct node *new_=malloc(sizeof(struct node));
   printf("Enter the data should be stored in new node:");
   scanf("%d",&new_->data);
   new_->next=NULL;
  
   //inserting new node between 6 & 4
   temp=LL->next->next;
   LL->next->next=NULL;
   new_->next=temp;
   LL->next->next=new_;
   printf("After inserting the new node between 6 & 4 the list is: ");
   printlist(LL);
}

screenshots:

# include<stdio.h> //Declaring the structure of the node struct node int data; struct node *next; //prints the list void printlist (struct node *temp) while(temp != NULL) printf("%d ", temp->data) temp-tempnext ; printf ("\n"); int main () struct node * LL-NULL, * temp=NULL; //Creating the given list LL=malloc (sizeof (struct node) ) ; LL->data-0 LL-next-malloc (sizeof (struct node)) LL->next->data- 6 LL-next->next-malloc (sizeof (struct node)); LL->next->next->data- 4; LL-next->next->next-malloc (sizeof (struct node)) LL->next->next->next->data-1 LL->next->next->next-next-NULL

printf ("Initially the given listln"); printlist (LL) printf ("printed by the statement in 'a'\n") printf ("%d %d\n", LL->next->next->data, LL->next->data) ; //Deleting the last node of the list LL->next->next->next-NULL free (LL-next->next->next); printf ("After Deleting the last node of the listln" printlist (LL) //Creating new node struct node *new -malloc (sizeof (struct node)) printf ("Enter the data should be stored in new node:"); scanf ( "%d" , &new->data) ; new->next=NULL; //inserting new node between 6& 4 temp-LL-next->next; LL->next->next-NULL new_->next temp: LL->next->next-new printf ("After inserting the new node between 6 & 4 the list is: \n") printlist (LL)

output:

CA Program Files (x86)\Dev-CpplConsolePauser.exe Initially the given list 6 41 rinted by the statement in 'a 4 6 After Deleting the last node of the list 06 4 Enter the data should be stored in new node:7 After inserting the new node between 6& 4 the list is: 6 74 Process exited with return value 10 Press any key to continue . - .

If you have any queries, please comment below.

Please upvote , if you like this answer.