datastructure12

///Home Work 12 @Nurnobi shanto
#include<stdio.h>
#include<stdlib.h>

typedef struct Node{
    char data[30];
    struct Node *ptr;
}node;
node *head = NULL;


int main(){
    printf("Enter Data to store:\n");
    node *n1;
    n1 = (node*)malloc(sizeof(node));
    scanf("%s", &n1-> data);
    n1-> ptr = NULL;
    head = n1;

    node *n2;
    n2 = (node*)malloc(sizeof(node));
    scanf("%s", &n2->data);
    n2-> ptr = NULL;
    n1-> ptr = n2;

    node *n3;
    n3 = (node*)malloc(sizeof(node));
    scanf("%s", &n3->data);
    n3->ptr = NULL;
    n2-> ptr = n3;


    node *temp = head;
    int c = 0;
    while(temp != NULL){
        printf("Stored Data: %s\n", temp-> data);
        temp = temp-> ptr;
        c++;
    }
    printf("\nTotal node: %d\n", c);

    return 0;
}