Python-Guide-for-Beginners/Code/linked_list.py at b269ec793b82dcaae77b485079ac6a3198689024 · HarendraSingh22/Python-Guide-for-Beginners · 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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
class Node:
    def __init__(self, value):
        self.value = value
        self.next = None


class LinkedList:
    def __init__(self):
        self.root = None

    def append(self, value):
        node = Node(value)
        if(self.root == None):
            self.root = node
            return

        temp = self.root
        while(temp.next != None):
            temp = temp.next

        temp.next = node

    def addFront(self, value):
        if(self.root == None):
            return

        node = Node(value)
        temp = self.root
        node.next = temp
        self.root = node

    def delete(self, listValue):
        if(self.root == None):
            return

        temp = self.root
        while(temp.next.value != listValue and temp.next != None):
            temp = temp.next

        if(temp.value != listValue):
            return
        tempOne = temp.next
        tempTwo = temp.next.next

        tempOne.next = None
        temp.next = tempTwo

    def deleteIndex(self, index):
        if(self.root == None):
            return
        if(index > self.len()-1):
            return

        temp = self.root
        counter = 0
        while(counter != index-1):
            temp = temp.next
            counter += 1

        tempOne = temp.next
        tempTwo = temp.next.next

        tempOne.next = None
        temp.next = tempTwo

    def deleteFront(self):
        if(self.root == None):
            return

        temp = self.root
        tempOne = temp.next

        temp.next = None
        tempOne = self.root

    def deleteLast(self):
        if(self.root == None):
            return
        if(self.root.next == None):
            self.root = None
            return

        temp = self.root
        while(temp.next.next != None):
            temp = temp.next
        temp.next = None

    def addPreValue(self, listValue, insertValue):
        if(self.root == None):
            return

        node = Node(insertValue)
        temp = self.root
        while(temp.next.value != listValue):
            temp = temp.next

        tempOne = temp.next
        temp.next = node
        node.next = tempOne

    def addPostValue(self, listValue, insertValue):
        if(self.root == None):
            return

        node = Node(insertValue)
        temp = self.root
        while(temp.value != listValue):
            temp = temp.next

        tempOne = temp.next
        temp.next = node
        node.next = tempOne

    def deletePreValue(self, listValue):
        if(self.root == None):
            return

        temp = self.root
        while(temp.next.next.value != listValue):
            temp = temp.next

        tempOne = temp.next
        tempTwo = temp.next.next
        tempOne.next = None
        temp.next = tempTwo

    def deletePostValue(self, listValue):
        if(self.root == None):
            return

        tmep = self.root
        while(temp.value != listValue):
            temp = temp.next

        tempOne = temp.next
        tempTwo = temp.next.next
        tempOne.next = None
        temp.next = tempTwo

    def len(self):
        if(self.root == None):
            return 0

        temp = self.root
        counter = 0
        while(temp != None):
            counter += 1

        return counter

    def __repr__(self):
        if(self.root == None):
            return ''

        string = ''
        temp = self.root
        while(temp != None):
            string = string+f'[{temp.value}-]->'
            temp = temp.next

        return string


if __name__ == "__main__":
    ll = LinkedList()
    ll.append(2)
    ll.addFront(1)
    ll.addPostValue(2, 3)
    print(ll)