//Q1) WAP to implement a linked list with three nodes to accept data at those nodes 
//and then display the nodes.

#include 
#include
using namespace std;

struct node{
    int data;
    node* next;
    void setData(int d){
        data=d;
        next=NULL;
    }
};

int main(){

    node* node1=(node*)malloc(sizeof(node));
    node1->setData(10);
    node* node2=(node*)malloc(sizeof(node));
    node2->setData(20);
    node* node3=(node*)malloc(sizeof(node));
    node3->setData(30);

    node1->next=node2;
    node2->next=node3;

    node* temp=node1;
    int nodeNumber=1;
    while(nodeNumber<=3){
        cout<<"Node: "<next<<", Data: "<data<next;
        nodeNumber++;
    }
    cout<