#include<stdio.h>
#include<conio.h>
 
struct Node
{
 int number;
 struct Node *link;
};
 
typedef struct Node* NodePtr;
 
void printNode(NodePtr head);
void insertNode(NodePtr *head,int numb);
 
int main(void)
{
    NodePtr head;
    int data;
 
    head=NULL;
 
     printf("\nWhat is the number : ");
     scanf("%d", &data);
 
    while(data>0)
    {
     insertNode(&head,data);
     printNode(head);
     printf("\nWhat is the number : ");
     scanf("%d", &data);
    }
 
 
 
    getch();
    return 0;
}
 
void printNode(NodePtr head)
{
     if (head==NULL)
     printf("The linked lists is NULL");
     else
     {
          printf("The nodes contain the numbers: \n");
     while (head!=NULL)
     {
           printf("%d -->",head->number);
           head=head->link;
     }
     printf(" NULL");
     }
} 
 
void insertNode(NodePtr *head,int numb)
{
     NodePtr newPtr;
     NodePtr previousPtr;
     NodePtr currentPtr;
 
     newPtr=malloc(sizeof(struct Node));
     newPtr->number=numb;
     newPtr->link=NULL;
 
     previousPtr=NULL;
     currentPtr=*head;
 
     while(currentPtr!=NULL && numb>currentPtr->number)
     {
      previousPtr=currentPtr;
      currentPtr=currentPtr->link;
     }
 
     if (previousPtr==NULL)
     {
      newPtr->link=currentPtr;
      currentPtr=newPtr;
     }
     else
     {
      previousPtr->link=newPtr;
      newPtr->link=currentPtr;
     }
}