mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-10 03:18:02 +00:00
@@ -1,19 +1,19 @@
|
||||
from nose.tools import assert_equal
|
||||
import unittest
|
||||
|
||||
|
||||
class TestDeleteNode(object):
|
||||
class TestDeleteNode(unittest.TestCase):
|
||||
|
||||
def test_delete_node(self):
|
||||
print('Test: Empty list, null node to delete')
|
||||
linked_list = MyLinkedList(None)
|
||||
linked_list.delete_node(None)
|
||||
assert_equal(linked_list.get_all_data(), [])
|
||||
self.assertEqual(linked_list.get_all_data(), [])
|
||||
|
||||
print('Test: One node')
|
||||
head = Node(2)
|
||||
linked_list = MyLinkedList(head)
|
||||
linked_list.delete_node(head)
|
||||
assert_equal(linked_list.get_all_data(), [None])
|
||||
self.assertEqual(linked_list.get_all_data(), [None])
|
||||
|
||||
print('Test: Multiple nodes')
|
||||
linked_list = MyLinkedList(None)
|
||||
@@ -22,7 +22,7 @@ class TestDeleteNode(object):
|
||||
node2 = linked_list.insert_to_front(4)
|
||||
node3 = linked_list.insert_to_front(1)
|
||||
linked_list.delete_node(node1)
|
||||
assert_equal(linked_list.get_all_data(), [1, 4, 2])
|
||||
self.assertEqual(linked_list.get_all_data(), [1, 4, 2])
|
||||
|
||||
print('Test: Multiple nodes, delete last element')
|
||||
linked_list = MyLinkedList(None)
|
||||
@@ -31,7 +31,7 @@ class TestDeleteNode(object):
|
||||
node2 = linked_list.insert_to_front(4)
|
||||
node3 = linked_list.insert_to_front(1)
|
||||
linked_list.delete_node(node0)
|
||||
assert_equal(linked_list.get_all_data(), [1, 4, 3, None])
|
||||
self.assertEqual(linked_list.get_all_data(), [1, 4, 3, None])
|
||||
|
||||
print('Success: test_delete_node')
|
||||
|
||||
@@ -42,4 +42,4 @@ def main():
|
||||
|
||||
|
||||
if __name__ == '__main__':
|
||||
main()
|
||||
main()
|
||||
|
||||
Reference in New Issue
Block a user