question5.c

/*
Recursive program to reverse a linked list
*/

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

struct node{
	int data;
	struct node *link;
};

struct node *head;

void printList(struct node *t){
	if(t){
		//interchanging these lines will print it in reverse order
		printf("%d\n", t->data);
		printList(t->link);
	}
}

void reverse(struct node *prev, struct node *curr){
	if(curr){
		reverse(curr, curr->link);
		curr->link = prev;
	}else{
		head = prev;
	}
}

int main(){

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

	struct node *t = head;

	int counter = 1;
	while(counter<=5){

		t->data = counter*10;
		if(counter == 5){
			t->link = NULL;
		}else{
			t->link = (struct node *)malloc(sizeof(struct node));
		}

		t = t->link;

		counter++;
	}
	t = head;
	printList(t);
	t = head;

	reverse(NULL,head);
	t = head;
	printList(t);
}