linked list

#include <stdio.h>
#include<malloc.h>
#include<iostream>
using namespace std;
void insert_last();
void display();
struct node
{
int info;
struct node *link;
} *start=NULL;
int item;
int main()
{
int choice;
do
{
printf("\n\n\n1. Insert Last\n2. Display\n3. Exit\n");
printf("\nEnter your choice: ");
scanf("%d",&choice);
switch(choice)
{
case 1:
insert_last();
break;
case 2:
display();
break;
case 3:
return 0;
default:
printf("\n\nInvalid choice. Please try again.\n");
}
} while (1);
}

void insert_last()
{
struct node *ptr;
printf("\n\nEnter item: ");
scanf("%d", &item);
if(start == NULL)
{
start = (struct node *)malloc(sizeof(struct node));
start->info = item;
start->link = NULL;
}
else
{
ptr =start;
while (ptr->link != NULL)
{
	ptr = ptr->link;
}

ptr->link = (struct node *)malloc(sizeof(struct node));
ptr = ptr->link;
ptr->info = item;
ptr->link = NULL;


}
printf("\nItem inserted: %d\n", item);
}
void display()
{
struct node *ptr = start;
int i=1;
if (ptr == NULL)
printf("\nLinklist is empty.\n");
else
{
printf("\nSr. No.\t\tAddress\t\tInfo\t\tLink\n");
while(ptr != NULL)
{
printf("\n%d.\t\t%d\t\t%d\t\t%d\n", i, ptr, ptr->info,ptr->link);
ptr = ptr->link;
i++;
}
}
}