Python Program to Print Alternate Nodes of a Linked List without Recursion

This is a Python program to print the alternate nodes of a linked list without using recursion.

Problem Description

The program creates a linked list using data items input from the user and displays the alternate data items.

Problem Solution

1. Create a class Node.
2. Create a class LinkedList.
3. Define method append inside the class LinkedList to append data to the linked list.
4. Define method alternate.
5. The method alternate uses a loop to iterate over the alternate nodes of the list and display them.
6. Create an instance of LinkedList and prompt the user for its elements.
7. Display the alternate data items of the linked list.

Program/Source Code

Here is the source code of a Python program to print the alternate nodes of a linked list without using recursion. The program output is shown below.

class Node:
    def __init__(self, data):
       self.data = data
       self.next = None
 
class LinkedList:
    def __init__(self):
        self.head = None
        self.last_node = None
 
    def append(self, data):
        if self.last_node is None:
            self.head = Node(data)
            self.last_node = self.head
        else:
            self.last_node.next = Node(data)
            self.last_node = self.last_node.next
 
    def alternate(self):
        current = self.head
        while current:
            print(current.data, end = ' ')
            if current.next is not None:
                current = current.next.next
            else:
                break
 
a_llist = LinkedList()
data_list = input('Please enter the elements in the linked list: ').split()
for data in data_list:
    a_llist.append(int(data))
 
print('The alternate nodes of the linked list: ', end = '')
a_llist.alternate()
Program Explanation

1. An instance of LinkedList is created.
2. The user is prompted for the elements of the list.
3. The elements are then appended to the linked list.
4. The method alternate is called to display the alternate nodes of the list.

advertisement
Runtime Test Cases
Case 1:
Please enter the elements in the linked list: 7 1 4 1 9 10 3
The alternate nodes of the linked list: 7 4 9 3 
 
Case 2:
Please enter the elements in the linked list: 1 2
The alternate nodes of the linked list: 1 
 
Case 3:
Please enter the elements in the linked list: 9
The alternate nodes of the linked list: 9

Sanfoundry Global Education & Learning Series – 1000 Python Programs.

If you wish to look at all Python Programming examples, go to 1000 Python Programs.

🔥 Enroll Now for Free Python Certification - December 2025

advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
I’m Manish - Founder and CTO at Sanfoundry. I’ve been working in tech for over 25 years, with deep focus on Linux kernel, SAN technologies, Advanced C, Full Stack and Scalable website designs.

You can connect with me on LinkedIn, watch my Youtube Masterclasses, or join my Telegram tech discussions.

If you’re in your 20s–40s and exploring new directions in your career, I also offer mentoring. Learn more here.