Linklist() { head=NULL; }
Bool checkempty() { if (head==NULL) return 1; else return 0; }
void Traverse() { if (checkempty()) { cout<<"List is empty"; } else { Node * curr; curr=head; while(curr!=NULL) { cout<<curr->data; cout<<endl; curr=curr->next; } } }
void InsertAtStart(int val) { Node *nnode=new Node; nnode->data=val; nnode->next=head; head=nnode; }