Question

solve this question using python language Given a singly linked list; you need to do two tasks. Swap the first node with the last node: Then count the number of nodes and if the number of nodes is an odd number then delete the first node; otherwise delete the last node of the linked list: For example; if the given linked list is 1->2->3->4->5 then the linked list should be modified t0 2-73-4->15 Because and 5 will be swapped and 5 will be deleted as the number of nodes in this linked list is 5 which is an Odd number that means the first node which contains 5 has been deleted. If the input linked list is NULL; then it should remain NULL. If the input linked list has node; then this node should be deleted and new head should be returned. Sample I: Input: NULL output: NULL. Sample 2: Input: output: NULL Sample 3: Input: [->2 output: 2 Sample Input: 1-2->3 output: 2->[ Sample 5: Input: 1-2>3->4 output: 4-2>3 Sample 6: Input: 1->2->3--4-75-26 output: 6->2->3->4--5 Input: The function takes one argument as input; the reference pointer to the head of the linked list. Output: Your function should return the head ofthe modified linked list: Ifthe linked list is empty then it should return NULL User Task: The task is to complete the function swapDelete(Node head) which will perform swap and should delete the first or last node from the linked list based on whether the number of nodes in the linked list is odd or even respectively: Java method signature= Node swapDelete (Node head) write your code here 1 {return new head of the linked list Python me thod signature swapDelete (head) write your code here return new head of the linked list

          solve this question using
python language

Given a singly linked list; you need to do two tasks. Swap the first node with the last node: Then count the number of nodes and if the number of nodes is an odd number then delete the first node; otherwise delete the last node of the linked list: For example; if the given linked list is 1->2->3->4->5 then the linked list should be modified t0 2-73-4->15 Because and 5 will be swapped and 5 will be deleted as the number of nodes in this linked list is 5 which is an Odd number that means the first node which contains 5 has been deleted.
If the input linked list is NULL; then it should remain NULL. If the input linked list has node; then this node should be deleted and new head should be returned.
Sample I: Input: NULL output: NULL. Sample 2: Input: output: NULL Sample 3: Input: [->2 output: 2 Sample Input: 1-2->3 output: 2->[ Sample 5: Input: 1-2>3->4 output: 4-2>3 Sample 6: Input: 1->2->3--4-75-26 output: 6->2->3->4--5
Input: The function takes one argument as input; the reference pointer to the head of the linked list.
Output: Your function should return the head ofthe modified linked list: Ifthe linked list is empty then it should return NULL
User Task: The task is to complete the function swapDelete(Node head) which will perform swap and should delete the first or last node from the linked list based on whether the number of nodes in the linked list is odd or even respectively:
Java method signature= Node   swapDelete (Node head) write your code here 1 {return new head of the linked list
Python me thod signature swapDelete (head) write your code here return new head of the linked list

solve this question using python language given a singly linked list you need to do two tasks swap the first node with the last node then count the number of nodes and if the number of nodes 01552

Added by Santiago J.

Question

Please give Ace some feedback