InsertionAtHead.SLL

#include <stdlib.h>
#include <iostream>
#include <vector>
using namespace std;
struct node {
    int data;
    node *next;

    node (int data1, node *next1) {
        data=data1;
        next=next1;
    }

    node (int data1) {
        data=data1;
        next=nullptr;
    }
};

void printNodes(node *head) {
    while (head!=NULL) {
        cout << head->data << endl;
        head=head->next;
    }
}

node *convertarr2LL (vector <int> &arr) {
    node *head=new node (arr[0]);
    node *mover=head;
    for (int i=1;i<arr.size();i++) {
        node *temp=new node (arr[i]);
        mover->next=temp;
        mover=mover->next;
    }
    return head;
}

node *InsertionAtHead (node *head, int value) {
    return new node (value,head); 
}
int main () {
    vector <int> arr = {1,2,3,4,5};
    node *head = convertarr2LL(arr);
    head= InsertionAtHead (head,0);
    printNodes(head);
}