lec1_4.cpp

// insertion at the end using recursion
#include<iostream>
using namespace std;
class Node
{
    public:
    int data;
    Node *next;

    Node(int value)
    {
        data = value;
        next = NULL;
    }
};
Node* CreateLinkedList(int arr[] , int index , int size)
{
    if(index == size)
    {
        return NULL;
    }
    Node *temp;
    temp = new Node(arr[index]);

    temp->next = CreateLinkedList(arr , index+1 , size);
    return temp;
}
int main() 
{
    Node *Head;
    Head = NULL;

    int arr[] = {2 , 4, 6, 8 , 10};

    CreateLinkedList(arr , 0 , 5);
    Node *temp = Head;
     while(temp)
    {
        cout<<temp->data<<" ";
        temp = temp->next;
    }
    return 0 ;
}