C Linked Lists

The code this far has the numbers being put in a linked list. How can I do something like this:

Would you like to enter an integer (y for yes/n for no)? y
Enter an integer:100
Would you like to enter an integer (y for yes/n for no)? y
Enter an integer:30
Would you like to enter an integer (y for yes/n for no)? y
Enter an integer:50
Would you like to enter an integer (y for yes/n for no)? y
Enter an integer:10
Would you like to enter an integer (y for yes/n for no)? n
Your list in reverse order is:
10 30 50 100


Here is the code. Do I need to make another funciton?
thank you, please help.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include<stdio.h>
#include<stdlib.h>
 
/* Link list node */
struct node
{
    int data;
    struct node* next;
};
 
/* Function to reverse the linked list */
static void reverse(struct node** head_ref)
{
    struct node* prev   = NULL;
    struct node* current = *head_ref;
    struct node* next;
    while (current != NULL)
    {
        next  = current->next; 
        current->next = prev;  
        prev = current;
        current = next;
    }
    *head_ref = prev;
}
 
/* Function to push a node */
void push(struct node** head_ref, int new_data)
{
    /* allocate node */
    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);   
        
    /* move the head to point to the new node */
    (*head_ref)    = new_node;
}
 
/* Function to print linked list */
void printList(struct node *head)
{
    struct node *temp = head;
    while(temp != NULL)
    {
        printf("%d  ", temp->data);   
        temp = temp->next; 
    }
}   
 
/* Drier program to test above function*/
int main()
{
    /* Start with the empty list */
    struct node* head = NULL;
   
     push(&head, 20);
     push(&head, 4);
     push(&head, 15);
     push(&head, 85);     
     
     printList(head);   
     reverse(&head);                     
     printf("\n Reversed Linked list \n");
     printList(head);   
     getchar();
}
Topic archived. No new replies allowed.