-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathoddEvenLL.py
43 lines (39 loc) · 933 Bytes
/
oddEvenLL.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
class Node(object):
def __init__(self, data):
self.data = data
self.next = None
class linkList(object):
def __init__(self):
self.head = None
def add2First(self, data):
newNode = Node(data)
if self.head == None:
self.head = newNode
else:
newNode.next = self.head
self.head = newNode
def oddEvenList(self):
temp = self.head
llEven = linkList()
llOdd = linkList()
while temp:
if temp.data%2 == 0:
llEven.add2First(temp.data)
else:
llOdd.add2First(temp.data)
temp = temp.next
tmp = llOdd.head
while(tmp.next):
tmp = tmp.next
tmp.next = llEven.head
return llOdd
def traverse(self):
temp = self.head
while (temp):
print(temp.data, end = "->")
temp = temp.next
ll = linkList()
ll.head = Node(3)
ll.head.next = Node(1)
ll.add2First(4)
ll.oddEvenList().traverse()