Linked | List | Question 42

Correct Program to find Middle of a Linked list ?

(A)

class Node:
def __init__(self, k):
self.data = k
self.next = None

def printList(head):
curr = head
while curr != None:
print(curr.data)
curr = curr.next
print()

def printMiddle(ptr):
if head == None:
return
count = 0
curr = head
while curr :
curr = curr.next
count+=1

curr = head
for i in range (count//2):
curr = curr.next
print(curr.data)

head = Node(10)
head.next = Node(10)
head.next.next = Node(20)
printList(head)
printMiddle(head)

(B)

class Node:
def __init__(self, k):
self.data = k
self.next = None

def printList(head):
curr = head
while curr != None:
print(curr.data)
curr = curr.next
print()
def printMiddle(ptr):
if head == None:
return
count = 0
curr = head
while curr :
curr != curr.next
count+=1

curr = head
for i in range (count//2):
curr = curr.next
print(curr.data)

head = Node(10)
head.next = Node(10)
head.next.next = Node(20)
printList(head)
printMiddle(head)

(C)

class Node:
def __init__(self, k):
self.data = k
self.next = None

def printList(head):
curr = head
while curr == None:
print(curr.data)
curr = curr.next
print()

def printMiddle(ptr):
if head == None:
return
count = 0
curr = head
while curr :
curr = curr.next
count+=1

curr = head
for i in range (count//2):
curr = curr.next
print(curr.data)

head = Node(10)
head.next = Node(10)
head.next.next = Node(20)
printList(head)
printMiddle(head)

(D)

class Node:
def __init__(self, k):
self.data = k
self.next = None

def printList(head):
curr = head
while curr != None:
print(curr.data)
curr = curr.next
print()

head = Node(10)
head.next = Node(10)
head.next.next = Node(20)

printList(head)
printMiddle(head)

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :

Share your thoughts in the comments

GeeksforGeeks

Trending in News