1.Adding the odd numbers to the beginning of the list and even numbers to the end of the list until -1 is entered from keyboard. struct node { int number; struct node * next; }; 2.A singly linear list stores integer values in each node and has multiple nodes. Write a function using given prototype below. This function cuts the last node of the list and adds it to the beginning as first node. It takes beginning address of the list as a parameter and returns the updated list. struct node* cutlastaddhead(struct node* head); struct node { int number; struct node * next; }; 3.In a linear linked list, write a function that deletes the element in the middle of the list (free this memory location) (if the list has 100 or 101 elements, it will delete the 50th element). The function will take a list as a parameter and return the updated list. 4.In a linear linked list, write a function named changeFirstAndLast that swaps the node at the end of the list and the node at the beginning of the list. The function will take a list as a parameter and return the updated list.
1.Adding the odd numbers to the beginning of the list and even numbers to the end of the list until -1 is entered from keyboard.
struct node {
int number;
struct node * next;
};
2.A singly linear list stores integer values in each node and has multiple nodes. Write a function using given prototype below. This function cuts the last node of the list and adds it to the beginning as first node. It takes beginning address of the list as a parameter and returns the updated list.
struct node* cutlastaddhead(struct node* head);
struct node {
int number;
struct node * next;
};
3.In a linear linked list, write a function that deletes the element in the middle of the list (free this memory location) (if the list has 100 or 101 elements, it will delete the 50th element). The function will take a list as a parameter and return the updated list.
4.In a linear linked list, write a function named changeFirstAndLast that swaps the node at the end of the list and the node at the beginning of the list. The function will take a list as a parameter and return the updated list.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 7 images
