Python Program To Check If A Linked List Of Strings Forms A Palindrome

Python Program For Printing Reverse Of A Linked List Without Actually Reversing

Last Updated : 08 Jul, 2022

Given a linked list, print reverse of it using a recursive function. For example, if the given linked list is 1->2->3->4, then output should be 4->3->2->1.
Note that the question is only about printing the reverse. To reverse the list itself see this
Difficulty Level: Rookie

reverse-a-link-list

Algorithm:

printReverse(head)
  1. call print reverse for head->next
  2. print head->data

Implementation:

Python3

# Python3 program to print reverse
# of a linked list 

# Node class 
class Node: 
    
    # Constructor to initialize
    # the node object 
    def __init__(self, data):         
        self.data = data 
        self.next = None
    
class LinkedList: 
    
    # Function to initialize head 
    def __init__(self): 
        self.head = None
    
    # Recursive function to print 
    # linked list in reverse order
    def printrev(self, temp):        
        if temp:
            self.printrev(temp.next)
            print(temp.data, end = ' ')
        else:
            return
        
    # Function to insert a new node 
    # at the beginning 
    def push(self, new_data):         
        new_node = Node(new_data) 
        new_node.next = self.head 
        self.head = new_node 

# Driver code
llist = LinkedList() 

llist.push(4) 
llist.push(3) 
llist.push(2) 
llist.push(1) 

llist.printrev(llist.head)
# This code is contributed by Vinay Kumar(vinaykumar71)

Output:

4 3 2 1

Time Complexity: O(n)

Space Complexity: O(n) for call stack since using recursion

Please refer complete article on Print reverse of a Linked List without actually reversing for more details!

Python Program To Check If A Linked List Of Strings Forms A Palindrome

kartik

Improve

Article Tags :

Practice Tags :

Similar Reads

Python Program For Reversing A Doubly Linked List

Given a Doubly Linked List, the task is to reverse the given Doubly Linked List. See below diagrams for example.Â (a) Original Doubly Linked List (b) Reversed Doubly Linked List Here is a simple method for reversing a Doubly Linked List. All we need to do is swap prev and next pointers for all nodes

Python Program For Swapping Nodes In A Linked List Without Swapping Data

Given a linked list and two keys in it, swap nodes for two given keys. Nodes should be swapped by changing links. Swapping data of nodes may be expensive in many situations when data contains many fields. It may be assumed that all keys in the linked list are distinct. Examples: Input : 10->15-

Reverse a List in Python Without Using reverse() Function

While reverse() is the easiest and most direct method to reverse a list in Python it's useful to know alternative approaches to reverse a list without relying on this function. Using SlicingWe can use Pythonâ€™s list-slicing feature to create a reversed list version without modifying the original one.

Python Program To Check If A Linked List Of Strings Forms A Palindrome

Given a linked list handling string data, check to see whether data is palindrome or not? Examples: Input: a -> bc -> d -> dcb -> a -> NULL Output: True String "abcddcba" is palindrome. Input: a -> bc -> d -> ba -> NULL Output: False String "abcdba" is not palindrome. Reco

Python Program For Reversing Alternate K Nodes In A Singly Linked List

Given a linked list, write a function to reverse every alternate k nodes (where k is an input to the function) in an efficient way. Give the complexity of your algorithm. Example: Inputs: 1->2->3->4->5->6->7->8->9->NULL and k = 3 Output: 3->2->1->4->5->6-

Python Program For Cloning A Linked List With Next And Random Pointer- Set 2

We have already discussed 2 different ways to clone a linked list. In this post, one more simple method to clone a linked list is discussed. Recommended: Please solve it on "PRACTICE" first, before moving on to the solution. The idea is to use Hashing. Below is algorithm.Â Traverse the original link

Python Program For Alternating Split Of A Given Singly Linked List- Set 1

Write a function AlternatingSplit() that takes one list and divides up its nodes to make two smaller lists 'a' and 'b'. The sublists should be made from alternating elements in the original list. So if the original list is 0->1->0->1->0->1 then one sublist should be 0->0->0 and

Python Program For Adding 1 To A Number Represented As Linked List

Number is represented in linked list such that each digit corresponds to a node in linked list. Add 1 to it. For example 1999 is represented as (1-> 9-> 9 -> 9) and adding 1 to it should change it to (2->0->0->0) Recommended: Please solve it on "PRACTICE" first, before moving on to

Python Program For Pointing To Next Higher Value Node In A Linked List With An Arbitrary Pointer

Given singly linked list with every node having an additional "arbitrary" pointer that currently points to NULL. Need to make the "arbitrary" pointer point to the next higher value node. We strongly recommend to minimize your browser and try this yourself first A Simple Solution is to traverse all n

Python Program For Cloning A Linked List With Next And Random Pointer In O(1) Space

Given a linked list having two pointers in each node. The first one points to the next node of the list, however, the other pointer is random and can point to any node of the list. Write a program that clones the given list in O(1) space, i.e., without any extra space. Examples: Input : Head of the