Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Given a singly linked list, you need to do two tasks. Swap the first node with the last node. Then delete the middle of the resulting linked list. For example, if the given linked list is 1->2-3-4->5 then the linked list should be modified to 5->2- 4>1. Because I and 5 will be swapped and 3 will be deleted. If there are even nodes, then there would be two middle nodes, we need to delete the second middle element. If the input linked list is NULL. then it should remain NULL. If the input linked list has 1 node, then this node should be deleted and a new head should be returned. Sample 1: Input: NULL ouput: NULL Sample 2: InputI oulput, NULL Sample 3: Input 122 output: 2. Sample 4. Input: 1-2 3>4-55 output: 5245), Sample 5: Input -2345-6 output. 6-2-3-5>1

Given a singly linked list, you need to do two tasks. Swap the first node with the last node. Then delete the middle of the resulting linked list. For example, if the given linked list is 1->2-3-4->5 then the linked list should be modified to 5->2- 4>1. Because I and 5 will be swapped and 3 will be deleted. If there are even nodes, then there would be two middle nodes, we need to delete the second middle element. If the input linked list is NULL. then it should remain NULL. If the input linked list has 1 node, then this node should be deleted and a new head should be returned. Sample 1: Input: NULL ouput: NULL Sample 2: InputI oulput, NULL Sample 3: Input 122 output: 2. Sample 4. Input: 1-2 3>4-55 output: 5245), Sample 5: Input -2345-6 output. 6-2-3-5>1

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
need the solves asap plz
Input: The function takes one argument as input, the reference pointer to the head of the linked list. Output: Your function should retur the head of the modified linked list. If the 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 middle 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 //zeturn new head of the linked list Python method signature: swapDelete (head): # write your code here #return new bead of the linked list
Transcribed Image Text:Input: The function takes one argument as input, the reference pointer to the head of the linked list. Output: Your function should retur the head of the modified linked list. If the 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 middle 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 //zeturn new head of the linked list Python method signature: swapDelete (head): # write your code here #return new bead of the linked list
Question Given a singly linked list, you need to do two tasks. Swap the first node with the last node. Then delete the middle of the resulting linked list. For example, if the given linked list is 1->2-3->4-5 then the linked list should be modified to 5->2- 4>1, Because I and 5 will be swapped and 3 will be deleted. If there are even nodes, then there would be two middle nodes, we need to delete the second middle element. If the input linked list is NULL, then it should remain NULL. If the input linked list has 1 node, then this node should be deleted and a new head should be returned. Sample 1: Input: NULL output. NULL. Sample 2: Input I ouiput, NULL Sample 3: Input 1>2 output: 2. Sample 4. Input. >2-3455 outpute 5-24M. Sample 5: Inpur 23-4 5-6 output 6 E5>1
Transcribed Image Text:Question Given a singly linked list, you need to do two tasks. Swap the first node with the last node. Then delete the middle of the resulting linked list. For example, if the given linked list is 1->2-3->4-5 then the linked list should be modified to 5->2- 4>1, Because I and 5 will be swapped and 3 will be deleted. If there are even nodes, then there would be two middle nodes, we need to delete the second middle element. If the input linked list is NULL, then it should remain NULL. If the input linked list has 1 node, then this node should be deleted and a new head should be returned. Sample 1: Input: NULL output. NULL. Sample 2: Input I ouiput, NULL Sample 3: Input 1>2 output: 2. Sample 4. Input. >2-3455 outpute 5-24M. Sample 5: Inpur 23-4 5-6 output 6 E5>1
Expert Solution
steps

Step by step

Solved in 5 steps with 9 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS