Function to Reverse a singly linked list.

PHOTO EMBED

Thu Aug 04 2022 11:56:51 GMT+0000 (UTC)

Saved by @sahmal #c++ #algorithm #dsa #sorting #insertionsort #insertion

Node *Reverse(Node *&head)
{
    if (head == NULL || head->next == NULL)
        return head;
    Node *NewHead = Reverse(head->next);
    head->next->next = head;
    head->next = NULL;
    return NewHead;
}
//in main the previous head becomes the last node
int main(){
  Node*newHead=Reverse(head);
  print(newhead);
}
content_copyCOPY