SearchElementInLL.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;
    }
};

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;
}

int SearchElementInLL (node *head,int value) {
    node *temp=head;
    while (temp) {
        if (temp->data==value) {
            return 1;
        }
        temp=temp->next;
    }
    return 0;
}

int main() {
    vector <int> arr= {1,2,3,4,5};
    node *head= convertarr2ll(arr);
    cout << SearchElementInLL (head,3);
}