Lecture 173:- Let's Code Recursive Display for Linked List

 

Sure! Here's the C++ code to display the elements of a singly linked list recursively:

cppCopy code

#include <iostream> using namespace std; // Node structure for singly linked list struct Node {    int data;    Node* next; }; // Function to create a new node with the given data Node* createNode(int data) {    Node* newNode = new Node();    newNode->data = data;    newNode->next = nullptr;    return newNode; } // Function to insert a new node at the end of the linked list void insertEnd(Node*& head, int data) {    Node* newNode = createNode(data);    if (head == nullptr) {        head = newNode;        return;    }    Node* temp = head;    while (temp->next != nullptr) {        temp = temp->next;    }    temp->next = newNode; } // Recursive function to display the elements of the linked list void displayLinkedListRecursive(Node* current) {    if (current == nullptr) {        cout << endl;        return;    }    cout << current->data << " ";    displayLinkedListRecursive(current->next); } // Function to free memory allocated for the linked list void deleteLinkedList(Node*& head) {    while (head != nullptr) {        Node* temp = head;        head = head->next;        delete temp;    } } int main() {    Node* head = nullptr;    // Inserting elements into the linked list    insertEnd(head, 1);    insertEnd(head, 2);    insertEnd(head, 3);    insertEnd(head, 4);    insertEnd(head, 5);    // Displaying the linked list recursively    cout << "Linked List: ";    displayLinkedListRecursive(head);    // Free memory and delete the linked list    deleteLinkedList(head);    return 0; }

In this code, we have the displayLinkedListRecursive function, which is a recursive function to display the linked list elements. The function takes the current node as an argument and prints its data value. Then, it calls itself with the next node until it reaches the end of the list (i.e., when the current node is nullptr).

When you run this code, it will display the elements of the linked list: 1 2 3 4 5. The recursive display will print the elements in the same order as the iterative display.