Question: Print a singly linked list in reverse order

Solution: Two Methods
1. Using Stacks
2. Using Recursion
struct node
{
int data;
struct node* next;
};

void printReverse(struct node* head)
{
if(head == NULL)
return;

printReverse(head->next);
printf("%d ", head->data);
}



void push(struct node** head_ref, char new_data)
{

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

/* put in the data */
new_node->data = new_data;

/* link the old list off the new node */
new_node->next = (*head_ref);

(*head_ref) = new_node;
}

int main()
{

struct node* head = NULL;

push(&head, 1);
push(&head, 2);
push(&head, 3);
push(&head, 4);

printReverse(head);
getchar();
}