link list operation

#include <iostream>
#include <stdlib.h>

using namespace std;
typedef struct mylist
{
    int data;
    struct mylist *next;
} node;


void insertlinklist(node *newnode,int data)
{
    while(newnode->next !=NULL)
    {
        newnode=newnode->next;
    }
    newnode->next=(node*)malloc(sizeof(node));
    newnode->next->data=data;
    newnode->next->next=NULL;
}
void displaylinklist(node *newnode)
{
    while(newnode->next !=NULL)
    {
        cout<< newnode->next->data<<"   ";
        newnode=newnode->next;
    }
    cout<<endl<<endl;
}
void deletenode(node *newnode,int data)
{
    while(newnode->next !=NULL)
    {
        if(newnode->next->data==data)
        {
            newnode->next=newnode->next->next;
        }
        newnode=newnode->next;
    }
}
void deletenodeatindex(node *newnode,int data)
{
    node *s;
    s=newnode;
    if(newnode==NULL)
    {

        return;
    }
    if(data==0)
    {
        newnode=s->next;
        free(s);
        return;
    }
    for(int i=0; s !=NULL&&i<data-1; i++)
    {
        s=s->next;
    }
    if(s==NULL ||s->next ==NULL)
    {
        return;
    }
    node *temp;
    temp=s->next->next;
    free(s->next);
    s->next=temp;


}
void deleteallnode(node *head)
{
    node *temp;
    while(head !=NULL)
    {
        temp=head->next;
        free(head);
        head=temp;
    }
    cout<< "my name is hadiuzzaman"<<endl;
    displaylinklist(head);
}
void foundposition(node *head,int position)
{
    node *temp;
    temp=head;
    int i=0;
    while(temp !=NULL)
    {
        if(position==i)
        {
            cout<< temp->data<<endl;
        }
        temp=temp->next;
        i++;
    }

}
int main()
{
    node *head;
    head=(node*)malloc(sizeof(node));
    head->next=NULL;
    insertlinklist(head,4);
    insertlinklist(head,23);
    insertlinklist(head,44);
    insertlinklist(head,88);
    displaylinklist(head);
    deletenode(head,44);
    displaylinklist(head);
    foundposition(head,3);

    deletenodeatindex(head,3);
    displaylinklist(head);
    deleteallnode(head);


}