-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlinked-list.py
52 lines (40 loc) · 1.21 KB
/
linked-list.py
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
class Node:
def __init__(self, data):
self.data = data
self.next = None
class Linked_list:
def __init__(self):
self.head = None
def insert_data_first(self, new_data):
new_node = Node(new_data)
new_node.next = self.head
self.head = new_node
def insert_data_last(self, new_data):
new_node = Node(new_data)
if self.head is None:
self.head = new_node
return
tmp = self.head
while (tmp.next):
tmp = tmp.next
tmp.next = new_node
def insert_data_custom(self, prev_node, new_data):
if prev_node is None:
print('ops!! enter a real prev node,your prev node is not exists!')
return
new_node = Node(new_data)
new_node.next = prev_node.next
prev_node.next = new_node
def traverse(self):
tmp = self.head
while (tmp):
print(tmp.data)
tmp = tmp.next
my_linked_list=Linked_list()
my_linked_list.head=Node('data1')
second_node=Node('data2')
my_linked_list.head.next=second_node
third_node=Node(3)
second_node.next=third_node
my_linked_list.insert_data_custom(second_node,4)
my_linked_list.traverse()