struct node
{
    int data;
    node* next;
};
node* head=NULL;
void deleteheadnode()
{
    if(head==NULL)
    cout<<"List Empty";
    else
    {
        node* ptr=head;
        head=head->next;
        free(ptr);
    }
}
                
            Preview:
        downloadDownload PNG
        downloadDownload JPEG
                        downloadDownload SVG
        
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter