Scribd
Upload
38 views3 pages

V. Data and Results

This document contains code to create and display a singly linked list in C. It defines a node structure with a data element and pointer. It includes functions to: 1) create a linked list by dynamically allocating nodes and accepting user input for the data in each node; 2) display the linked list by traversing the nodes and printing the data. The main function calls the create and display functions, allowing the user to input the number of nodes and see the inputted data.

Uploaded by

Alyssa Limpiada
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
38 views3 pages

V. Data and Results

This document contains code to create and display a singly linked list in C. It defines a node structure with a data element and pointer. It includes functions to: 1) create a linked list by dynamically allocating nodes and accepting user input for the data in each node; 2) display the linked list by traversing the nodes and printing the data. The main function calls the create and display functions, allowing the user to input the number of nodes and see the inputted data.

Uploaded by

Alyssa Limpiada
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

V.

Data and Results

EXERCISE NO. 1

#include <stdio.h>

#include <stdlib.h>

#include <conio.h>

struct node {

int num;

struct node *nextptr;

}*stnode;

void createNodeList(int n);

void displayList();

int main(){

int n;

clrscr();

printf("\n\nLINKED LIST: To create and display Singly Linked


List:\n");

printf("------------------------------------------------------\n");

printf("Input the number of nodes: ");

scanf("%d", &n);

createNodeList(n);

printf("\nData entered in the list : \n");

displayList();

getch();

return 0;

}
void createNodeList (int n){

struct node *fnNode, *tmp;

int num, i;

stnode = (struct node *)malloc(sizeof(struct node));

if (stnode == NULL){

printf("Memory can not be allocated.");

else {

printf ("Input data for node 1: ");

scanf("%d", &num);

stnode->num = num;

stnode->nextptr = NULL;

tmp=stnode;

for (i=2;i<=n;i++){

fnNode = (struct node *)malloc(sizeof(struct node));

if(fnNode == NULL){

printf("Memory can not be allocated.");

break;

else {

printf("Input data for node %d: ", i);

scanf(" %d", &num);

fnNode->num = num;

fnNode->nextptr = NULL;

tmp->nextptr = fnNode;

tmp = tmp->nextptr;

}
}

void displayList(){

struct node *tmp;

if(stnode == NULL){

printf ("List is empty.");

else{

tmp = stnode;

while (tmp != NULL){

printf("Data = %d\n", tmp->num);

tmp = tmp->nextptr;

Fig. 1 lets the user input the number


of nodes and the data for the nodes
and then program display the inputted
data.

You might also like