“Итерация через связанный список” Ответ

Итерация через связанный список

#include<stdio.h>
#include<stdlib.h>

//1
typedef struct node{
	int value;
	struct node *next;
}node;


int main(){
	int length,i;

	//2
	printf("Enter size of the list : ");
	scanf("%d",&length);

	//3
	struct node *headNode, *currentNode, *temp;

	//4
	for(i=0 ; i<length; i++){ //5 currentNode = (node *)malloc(sizeof(node)); //6 printf("Enter element %d : ",(i+1)); scanf("%d", ¤tNode->value);

		//7
		if(i==0){
			headNode = temp = currentNode;
		}else{
			//8
			temp->next = currentNode;
			temp = currentNode;
		}
	}

	//9
	temp->next = NULL;

	//10
	temp = headNode;

	//11
	printf("Iterating through the elements of the linked list : \n");
	while(temp != NULL){
		//12
		printf("%d \n",temp->value);
		temp = temp -> next;
	}
}