Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
curr = curr.next self.assertEqual(5, curr.val) tail = curr self.assert IsNone (tail.next) self.assertRaises (ValueError, delete_node, tail) self.assertRaises (ValueError, delete_node, tail.n

curr = curr.next self.assertEqual(5, curr.val) tail = curr self.assert IsNone (tail.next) self.assertRaises (ValueError, delete_node, tail) self.assertRaises (ValueError, delete_node, tail.n

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
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 - 2 - 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function. import unittest class Node: definit__(self,x): self.val x self.next = None def delete_node (node): if node is None or node.next is None: raise ValueError node.val node.next.val node.next = node.next.next class TestSuite(unittest. TestCase): def test delete_node(self): # make linkedlist 1 -> 2> 3>4 head Node (1) curr head for i in range (2, 6): curr.next = Node (i) curr = curr.next # node3 = 3 node3 head.next.next # after delete_node => 1 -> 2 -> 4 delete_node (node3) curr = head self.assertEqual (1, curr.val) curr = curr.next self.assertEqual (2, curr.val) curr = curr.next self.assertEqual(4, curr.val) curr = curr.next self.assertEqual(5, curr.val) tail = curr self.assertIsNone(tail.next) self.assertRaises (ValueError, delete_node, tail) self.assertRaises (ValueError, delete_node, tail.next) if _name__ == '__main__': unittest.main()
Transcribed Image Text:1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 - 2 - 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function. import unittest class Node: definit__(self,x): self.val x self.next = None def delete_node (node): if node is None or node.next is None: raise ValueError node.val node.next.val node.next = node.next.next class TestSuite(unittest. TestCase): def test delete_node(self): # make linkedlist 1 -> 2> 3>4 head Node (1) curr head for i in range (2, 6): curr.next = Node (i) curr = curr.next # node3 = 3 node3 head.next.next # after delete_node => 1 -> 2 -> 4 delete_node (node3) curr = head self.assertEqual (1, curr.val) curr = curr.next self.assertEqual (2, curr.val) curr = curr.next self.assertEqual(4, curr.val) curr = curr.next self.assertEqual(5, curr.val) tail = curr self.assertIsNone(tail.next) self.assertRaises (ValueError, delete_node, tail) self.assertRaises (ValueError, delete_node, tail.next) if _name__ == '__main__': unittest.main()
Expert Solution
steps

Step by step

Solved in 3 steps with 1 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