@@ -16,13 +16,13 @@ def test_stack(self):
16
16
17
17
self .assertEqual (myStack .pop (), 3 )
18
18
self .assertEqual (myStack .peek (), 12 )
19
- self .assertFalse (myStack .isEmpty ())
19
+ self .assertFalse (myStack .is_empty ())
20
20
21
21
nullStack = stack .Stack ()
22
22
23
23
self .assertEqual (nullStack .pop (), - 1 )
24
24
self .assertEqual (nullStack .peek (), - 1 )
25
- self .assertTrue (nullStack .isEmpty ())
25
+ self .assertTrue (nullStack .is_empty ())
26
26
27
27
class TestInfixToPostfix (unittest .TestCase ):
28
28
def test_infix_to_postfix (self ):
@@ -45,11 +45,21 @@ def test_queue(self):
45
45
46
46
self .assertEqual (myQueue .dequeue (), 2 )
47
47
self .assertEqual (myQueue .dequeue (), 10 )
48
- self .assertFalse (myQueue .isEmpty ())
48
+ self .assertFalse (myQueue .is_empty ())
49
49
self .assertEqual (myQueue .dequeue (), 12 )
50
50
self .assertEqual (myQueue .dequeue (), 3 )
51
- self .assertTrue (myQueue .isEmpty ())
52
-
51
+ self .assertTrue (myQueue .is_empty ())
52
+
53
+ def test_deque (self ):
54
+ myDeque = queue .Deque ()
55
+ myDeque .insert_front (1 ) # 1
56
+ myDeque .insert_rear (2 ) # 2 1
57
+ myDeque .insert_front (3 ) # 2 1 3
58
+ myDeque .insert_rear (10 ) # 10 2 1 3
59
+
60
+ self .assertEqual (myDeque .delete_rear (), 10 )
61
+ self .assertEqual (myDeque .delete_front (), 3 )
62
+
53
63
class TestLinkedList (unittest .TestCase ):
54
64
def test_singly_linked_list (self ):
55
65
List = linked_list .SinglyLinkedList ()
0 commit comments