Scribd
Upload
182 views2 pages

Swap Nodes in A Linked List Without Swapping Data

This Python program defines a LinkedList class with Node objects that contain data and a next pointer. The swapNodes method searches the linked list for the nodes with the given data values x and y, then swaps their next pointers. A push method adds a new node to the start of the list. The program tests swapNodes by creating a sample linked list, swapping nodes 3 and 4, and printing the list before and after.

Uploaded by

ajay1kumar1prajapati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
182 views2 pages

Swap Nodes in A Linked List Without Swapping Data

This Python program defines a LinkedList class with Node objects that contain data and a next pointer. The swapNodes method searches the linked list for the nodes with the given data values x and y, then swaps their next pointers. A push method adds a new node to the start of the list. The program tests swapNodes by creating a sample linked list, swapping nodes 3 and 4, and printing the list before and after.

Uploaded by

ajay1kumar1prajapati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

# Python program to swap two given nodes of a linked list

class LinkedList(object):
def __init__(self):
self.head = None

# head of list
class Node(object):
def __init__(self, d):
self.data = d
self.next = None

# Function to swap Nodes x and y in linked list by


# changing links
def swapNodes(self, x, y):

# Nothing to do if x and y are same


if x == y:
return

# Search for x (keep track of prevX and CurrX)


prevX = None
currX = self.head
while currX != None and currX.data != x:
prevX = currX
currX = currX.next

# Search for y (keep track of prevY and currY)


prevY = None
currY = self.head
while currY != None and currY.data != y:
prevY = currY
currY = currY.next

# If either x or y is not present, nothing to do


if currX == None or currY == None:
return
# If x is not head of linked list
if prevX != None:
prevX.next = currY
else: #make y the new head
self.head = currY

# If y is not head of linked list


if prevY != None:
prevY.next = currX
else: # make x the new head
self.head = currX

# Swap next pointers


temp = currX.next
currX.next = currY.next
currY.next = temp

# Function to add Node at beginning of list.


def push(self, new_data):

# 1. alloc the Node and put the data


new_Node = self.Node(new_data)
# 2. Make next of new Node as head
new_Node.next = self.head

# 3. Move the head to point to new Node


self.head = new_Node

# This function prints contents of linked list starting


# from the given Node
def printList(self):
tNode = self.head
while tNode != None:
print (tNode.data)
tNode = tNode.next

# Driver program to test above function


llist = LinkedList()

# The constructed linked list is:


# 1->2->3->4->5->6->7
llist.push(7)
llist.push(6)
llist.push(5)
llist.push(4)
llist.push(3)
llist.push(2)
llist.push(1)
print ("Linked list before calling swapNodes() ")
llist.printList()
llist.swapNodes(4, 3)
print ("\nLinked list after calling swapNodes() ")
llist.printList()

--------------------------------------------------
OUTPUT
------------------------------------------------
Linked list before calling swapNodes()
1
2
3
4
5
6
7

Linked list after calling swapNodes()


1
2
4
3
5
6
7

You might also like