python reverse linked list
def reverseLinkedList(root):
cur = root
prev = None
while cur:
nxt = cur.next
cur.next = prev
prev = cur
cur = nxt
return prev
python reverse linked list
def reverseLinkedList(root):
cur = root
prev = None
while cur:
nxt = cur.next
cur.next = prev
prev = cur
cur = nxt
return prev
Reverse a Linked List
/* Before changing next pointer of current node,
store the next node */
next = curr -> next
/* Change next pointer of current node */
/* Actual reversing */
curr -> next = prev
/* Move prev and curr one step ahead */
prev = curr
curr = next
reverse a linked list
class recursion {
static Node head; // head of list
static class Node {
int data;
Node next;
Node(int d)
{ data = d;
next = null; } }
static Node reverse(Node head)
{
if (head == null || head.next == null)
return head;
/* reverse the rest list and put the first element
at the end */
Node rest = reverse(head.next);
head.next.next = head;
/* tricky step -- see the diagram */
head.next = null;
/* fix the head pointer */
return rest;
} /* Function to print linked list */
static void print()
{
Node temp = head;
while (temp != null) {
System.out.print(temp.data + " ");
temp = temp.next;
}
System.out.println();
}
static void push(int data)
{
Node temp = new Node(data);
temp.next = head;
head = temp;
} /* Driver program to test above function*/
public static void main(String args[])
{
/* Start with the empty list */
push(20);
push(4);
push(15);
push(85);
System.out.println("Given linked list");
print();
head = reverse(head);
System.out.println("Reversed Linked list");
print();
} } // This code is contributed by Prakhar Agarwal
Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us