python-algorithms/test_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
import linkedlist


def test_build_node():
    x = linkedlist.SortedLinkedList.from_list([1, 2, 3, 4])
    assert x is not None

    z = x.head.find_deepest_value()
    assert z == 4


def test_build_linkedlist_should_insert_correctly():
    ll = linkedlist.SortedLinkedList()
    ll.insert(1)
    ll.insert(4)
    ll.insert(5)

    assert ll.head.find_deepest_value() == 5


def test_linkedlist_should_put_number_before():
    ll = linkedlist.SortedLinkedList()
    ll.insert(4)
    ll.insert(1)

    assert ll.head.find_deepest_value() == 4


def test_linkedlist_should_put_value_in_the_middle():
    ll = linkedlist.SortedLinkedList()
    ll.insert(1)
    ll.insert(4)
    ll.insert(5)

    # this should be inserted on the head (first next value)
    ll.insert(2)


def test_linkedlist_should_convert_to_list_with_no_head():
    ll = linkedlist.SortedLinkedList()
    assert list(ll) == []


def test_linkedlist_should_work_with_depth1():
    ll = linkedlist.SortedLinkedList()
    ll.insert(1)

    assert list(ll) == [1]


def test_linkedlist_should_work_with_multiple_values():
    ll = linkedlist.SortedLinkedList()
    ll.insert(1)
    ll.insert(2)
    ll.insert(4)
    ll.insert(5)

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


def test_linkedlist_delete_no_data():
    ll = linkedlist.SortedLinkedList()
    assert ll.delete_first_value(1) == 0


def test_delete_with_direct_match_no_next_value():
    ll = linkedlist.SortedLinkedList()
    ll.insert(2)

    ll.delete_first_value(2)

    assert ll.head is None


def test_delete_with_direct_match_next_value():
    ll = linkedlist.SortedLinkedList()
    ll.insert(1)
    ll.insert(2)
    ll.insert(3)

    ll.delete_first_value(2)

    assert ll.head.value == 1
    assert ll.head.next.value == 3


def test_linkedlist_iterating():
    ll = linkedlist.SortedLinkedList()
    ll.insert(1)
    ll.insert(2)
    ll.insert(3)

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

    assert len(ll) == 3


def test_multidelete_linkedlist():
    ll = linkedlist.SortedLinkedList()
    ll.insert(1)
    ll.insert(2)
    ll.insert(2)
    ll.insert(3)

    result = ll.delete_value(2)
    assert result == 2