forked from raviprakashdev/simplePythonProgram
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedList.py
More file actions
61 lines (47 loc) · 1.04 KB
/
LinkedList.py
File metadata and controls
61 lines (47 loc) · 1.04 KB
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
"""
Author: Tanseer Saji <github.com/tanseersaji>
Desc: An Implementation of Linked List Data Structure
"""
class Node:
def __init__(self, val=0, next=None) -> None:
self.val = val
self.next = next
def search(root, val) -> bool:
ptr = root
while ptr:
if ptr.val == val:
return True
ptr = ptr.next
return False
def traverse(root) -> None:
ptr = root
while ptr:
print(ptr.val)
ptr = ptr.next
def insert(root, val) -> None:
ptr = root
while ptr.next:
ptr = ptr.next
ptr.next = Node(val)
def delete(root, val) -> None:
ptr = root
if ptr.val == val:
root = ptr.next
ptr = None
return
prev = None
while ptr:
if ptr.val == val:
break
prev = ptr
ptr = ptr.next
if not ptr:
return
prev.next = ptr.next
ptr = None
if __name__ == "__main__":
llist = Node(0)
for i in range(1, 10):
insert(llist, i)
delete(llist, 1)
traverse(llist)