-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedList_odd.py
More file actions
64 lines (52 loc) · 1.47 KB
/
LinkedList_odd.py
File metadata and controls
64 lines (52 loc) · 1.47 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
62
63
64
'''
Python3 program to rearrange a linked list in such a way that all odd positioned node are stored before all even positioned nodes
'''
class Node:
def __init__(self,data):
self.data=data
self.next=None
class LinkedList:
def __init__(self):
self.head=None
def insertAtBeg(self,key):
newNode=Node(key)
newNode.next=self.head
self.head=newNode
def rearrangeEvenOdd(self):
#Corner Cases
if(self.head==None or self.head.next==None ):
return
odd=self.head
even=self.head.next
evenFirst= even
while(odd.next.next and even.next.next) is not None:
odd.next=even.next
odd=even.next
even.next=odd.next
even=odd.next
if odd.next.next is not None:
odd.next=even.next
odd=even.next
even.next=None
odd.next=evenFirst
return
def printList(self):
temp=self.head
while temp:
print(temp.data,end="")
print("->", end="")
temp=temp.next
print("Null")
llist = LinkedList()
llist.insertAtBeg(7)
llist.insertAtBeg(6)
llist.insertAtBeg(5)
llist.insertAtBeg(4)
llist.insertAtBeg(3)
llist.insertAtBeg(2)
llist.insertAtBeg(1)
print("Before Rearrange")
llist.printList()
llist.rearrangeEvenOdd()
print("After Rearrange")
llist.printList()