Linked list program in c++ part1

linked list program in c++:

insert at front

linked list program in c++ insert_at front

program:

#include<iostream>
using namespace std;
struct node
{
int data;
node*next;
};
class linklist
{
private:
node*start,*last;
public:
linklist(){
start=last=0;
}
void insertatfront(int x)
{node*box=new node();
box->data=x;
box->next=0;
if(start==0){
start=last=box;
}
else{
box->next=start;
start=box;
}}
void insertatlast( int d)
{
node*p=new node();
p->data=d;
p->next=0;
node*ptr=start;
while(ptr->next=0)
{ptr=ptr->next;
}
ptr->next=p;
}
void delete_atfront(){
if(start==0)
{
cout<<"list is empty"<<endl;
return;
}
else{
node*temp=start;
start=start->next;
delete temp;
}}
void disp()
{node*temp=start;
while(temp!=0){
cout<<"this is the values"<<temp->data<<endl;
cout<<"this is the addresss"<<temp->next<<endl;
temp=temp->next;
}}};
void main()
{
linklist lists;
lis
ts.insertatfront(10);
lists.insertatfront(12);
lists.insertatfront(13);
lists.insertatfront(14);
lists.insertatfront(15);
lists.disp();
system("pause");
}

output: