1class Node:
2 def __init__(self, data = None, next_node = None):
3 self.data = data
4 self.nextNode = next_node
5
6 def get_data(self):
7 return self.data
8
9 def set_data(self, data):
10 self.data = data
11
12 def get_nextNode(self):
13 return self.nextNode
14
15 def set_nextNode(self, nextNode):
16 self.nextNode = nextNode
17
18
19class LinkedList:
20 def __init__(self, head = None):
21 self.head = head
22
23
24 def add_Node(self, data):
25 # if empty
26 if self.head == None:
27 self.head = Node(data)
28
29
30 # not empty
31 else:
32 curr_Node = self.head
33
34 # if node added is at the start
35 if data < curr_Node.get_data():
36 self.head = Node(data, curr_Node)
37
38 # not at start
39 else:
40 while data > curr_Node.get_data() and curr_Node.get_nextNode() != None:
41 prev_Node = curr_Node
42 curr_Node = curr_Node.get_nextNode()
43
44 # if node added is at the middle
45 if data < curr_Node.get_data():
46 prev_Node.set_nextNode(Node(data, curr_Node))
47
48
49 # if node added is at the last
50 elif data > curr_Node.get_data() and curr_Node.get_nextNode() == None:
51 curr_Node.set_nextNode(Node(data))
52
53
54
55 def search(self, data):
56 curr_Node = self.head
57 while curr_Node != None:
58 if data == curr_Node.get_data():
59 return True
60
61 else:
62 curr_Node = curr_Node.get_nextNode()
63
64 return False
65
66
67 def delete_Node(self, data):
68 if self.search(data):
69 # if data is found
70
71 curr_Node = self.head
72 #if node to be deleted is the first node
73 if curr_Node.get_data() == data:
74 self.head = curr_Node.get_nextNode()
75
76 else:
77 while curr_Node.get_data() != data:
78 prev_Node = curr_Node
79 curr_Node = curr_Node.get_nextNode()
80
81 #node to be deleted is middle
82 if curr_Node.get_nextNode() != None:
83 prev_Node.set_nextNode(curr_Node.get_nextNode())
84
85 # node to be deleted is at the end
86 elif curr_Node.get_nextNode() == None:
87 prev_Node.set_nextNode(None)
88
89 else:
90 return "Not found."
91
92 def return_as_lst(self):
93 lst = []
94 curr_Node = self.head
95 while curr_Node != None:
96 lst.append(curr_Node.get_data())
97 curr_Node = curr_Node.get_nextNode()
98
99 return lst
100
101 def size(self):
102 curr_Node = self.head
103 count = 0
104 while curr_Node:
105 count += 1
106 curr_Node = curr_Node.get_nextNode()
107 return count
108
109
110## TEST CASES #
111test1 = LinkedList()
112test2 = LinkedList()
113test1.add_Node(20)
114test1.add_Node(15)
115test1.add_Node(13)
116test1.add_Node(14)
117test1.delete_Node(17)
118print(test1.return_as_lst())
119print(test2.size())
1Full Linked List implementation at this link:
2https://github.com/shreyasvedpathak/Data-Structure-Python/tree/master/LinkedList
1
2class Node:
3 def __init__(self, val):
4 self.val = val
5 self.next = None
6
7 def nexts(self, nexts):
8 self.next = nexts
9
10
11 def __repr__(self):
12 return f'{self.val} -> {self.next} '
13
14
15class LinkedList:
16 def __init__(self):
17 self.head = None
18
19 def add(self, val):
20 if self.head == None:
21 self.head = val
22 else:
23 val.next = self.head
24 self.head = val
25
26 def __repr__(self):
27 return self.head.__repr__()
28
29 def __iter__(self):
30 li = self.head
31 while li.next != None:
32 yield li.val
33 li = li.next
34 yield li.val
35
36 def __getitem__(self, n):
37 if n==0: return self.head.val
38 li = self.head
39 for i in range(n):
40 li = li.next
41 return li.val
42
43 def __len__(self):
44 for i,v in enumerate(self):
45 pass
46 return i+1
47
1class Node:
2 def __init__(self, data):
3 self.data = data
4 self.next = None
5
6 def __repr__(self):
7 return self.data
8
9class LinkedList:
10 def __init__(self):
11 self.head = None
12
13 def __repr__(self):
14 node = self.head
15 nodes = []
16 while node is not None:
17 nodes.append(node.data)
18 node = node.next
19 nodes.append("None")
20 return " -> ".join(nodes)
21
1class LinkedList(object):
2 def __init__(self, head=None):
3 self.head = head
4
5 # ignored... answer below
6 def get_position(self, position):
7 counter = 1
8 current = self.head
9 if position < 1:
10 return None
11 while current and counter <= position:
12 if counter == position:
13 return current
14 current = current.next
15 counter += 1
16 return None
17 # ignored... answer above
181234567891011121314151617