python-algorithms/test_nonsorted_linkedlist.py at main · basvandriel/python-algorithms · GitHub

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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
from nonsorted_linkedlist import NonSortedLinkedList


def test_should_be_empty():
    result = NonSortedLinkedList().is_empty()
    assert result is True


def test_single_insert():
    ll = NonSortedLinkedList()
    ll.insert(1)

    assert ll.is_empty() is False
    assert ll.head.value == 1


def test_double_insert():
    ll = NonSortedLinkedList()
    ll.insert(1)
    ll.insert(2)

    assert ll.is_empty() is False
    assert ll.head.size == 2

    ll.head.find_deepest_node() == 2


def test_insert_with_5_and_should_find_deepest_value():
    ll = NonSortedLinkedList()
    ll.insert(1)
    ll.insert(2)
    ll.insert(5)
    ll.insert(1)
    ll.insert(90)

    ll.head.find_deepest_node().value == 90


def test_it_should_work_iterating():
    ll = NonSortedLinkedList()
    ll.insert(1)
    ll.insert(2)
    ll.insert(5)
    ll.insert(1)

    assert list(ll) == [1, 2, 5, 1]


def test_delete_on_empty_list():
    ll = NonSortedLinkedList()
    result = ll.delete(0)
    assert result == 0


def test_delete_on_size_1_list_with_matching_value():
    ll = NonSortedLinkedList()

    ll.insert(1)

    result = ll.delete(1)
    assert result == 1


def test_delete_on_size_1_list_with_nonmatching_value():
    ll = NonSortedLinkedList()
    ll.insert(1)

    result = ll.delete(9)
    assert result == 0


def test_delete_nested_value_in_next():
    ll = NonSortedLinkedList()
    ll.insert(1)
    ll.insert(9)
    result = ll.delete(9)
    assert result == 1

    assert list(ll) == [1]


def test_multidelete_not_in_head():
    ll = NonSortedLinkedList()
    ll.insert(1)
    ll.insert(2)
    ll.insert(3)
    ll.insert(9)
    ll.insert(9)
    ll.delete(9)

    assert list(ll) == [1, 2, 3]


def test_delete_multiple_one_in_head():
    ll = NonSortedLinkedList()
    ll.insert(1)
    ll.insert(2)
    ll.insert(1)
    ll.insert(1)

    result = ll.delete(1)

    assert result == 3
    assert list(ll) == [2]


def test_delete_last_node():
    ll = NonSortedLinkedList()
    ll.insert(1)
    ll.insert(2)
    ll.insert(3)

    result = ll.delete(3)

    assert list(ll) == [1, 2]