ADT_Linklist_node.c

// author: jaydattpatel
#include <stdio.h>
#include <stdlib.h>

// Creating a node
struct node 
{
  int value;
  struct node *next;
};

// print the linked list value
void printLinkedlist(struct node *p) 
{
  while (p != NULL) 
  {
    printf("%d ", p->value);  //print value of current structure data with pointer
    p = p->next;    //pointer will move to next address which stored in current p->next 
  }
}

int main() {
  // Initialize nodes
  struct node *head;
  struct node *one = NULL;
  struct node *two = NULL;
  struct node *three = NULL;

  // Allocate memory
  one = malloc(sizeof(struct node));
  two = malloc(sizeof(struct node));
  three = malloc(sizeof(struct node));

  // Assign value values
  one->value = 15;
  two->value = 26;
  three->value = 37;

  // Connect nodes
  //store the address of next structure into variable pointer of current structure 
  one->next = two;   
  two->next = three;
  three->next = NULL;

  // printing node-value
  head = one;
  printLinkedlist(head);
}