LinkedList Insertion at the End

Algorithm

INPUT: HEADER IS A POINTER TO THE HEADER NODE OF THE LINKEDLIST AND X IS THE ELEMENT TO BE INSERTED
OUTPUT: LINKEDLIST WITH THE ADDED ELEMENT
DATA STRUCTURE: SINGLY LINKEDLIST

STEP 1: NEW=GETNODE(NODE)
STEP 2: IF(NEW=NULL)THEN
STEP 3: PRINT("MEMORY INSUFFICIENT")
STEP 4: EXIT 
STEP 5: ELSE
STEP 6: PTR=HEADER->LINK
STEP 7: WHILE(PTR->LINK!-NULL)DO
STEP 8: PTR=PTR->LINK
STEP 9: ENDWHILE
STEP 10: NEW->DATA=X
STEP 11: NEW->LINK=NULL
STEP 12: PTR->LINK=NEW
STEP 13: ENDIF
STEP 14: STOP

Code

#include <stdio.h>
#include <stdlib.h>
int getnode(int);
void display();
void newnode();int x;struct node{int data;struct node *link;};struct node *prev,*head,*news,*p,*ptr;
struct node *header;
int main(){
int n;
printf("ENTER THE LIMIT");
scanf("%d",&n);
getnode(n);
return 0;}
void display(struct node *head){
struct node *ptr;
ptr=header->link;
while(ptr!=NULL){
printf("%d ",ptr->data);
ptr=ptr->link;} }
void newnode(){
 news=NULL;
news=malloc(sizeof(struct node));
 news->data=x;
 if(news==NULL) {
 printf("memory Insufficient");}
 else{
 ptr=head;
 while(ptr!=NULL){
 ptr=ptr->link;}
 news->link=NULL;
 p->link=news; }}
int getnode(int n){
header=malloc(sizeof(struct node));
head=NULL;
for(int i=0;i<n;i++){
p=malloc(sizeof(struct node));
scanf("%d",&p->data);
p->link=NULL;
if(head==NULL)
head=p;
else
prev->link=p;
prev=p;
}header->link=head;
display(header);
printf("Enter the number to be inserted at the end");
scanf("%d",&x);
newnode();
display(header);
return 0;}

Output

user@computer$ : ENTER THE LIMIT2
1
2
1 2 Enter the number to be inserted at the end3
1 2 3