linked_list/linked_list1.cpp
// returns addres of that node where the key is present
returns addres of that node where the key is present
returns addres of that node where the key is present
Node * search_node(struct Node *p, int key)
{
    while (p)
    {
        if(key == p->data)
        {
            return p;
        }
        p = p->next;
    }
    return NULL;
}
Node * search_node ( struct Node * p , int key ) { while ( p ) { if ( key == p -> data ) { return p ; } p = p -> next ; } return NULL ; }
returns addres of that node where the key is present
returns addres of that node where the key is present
// while(p != NULL) // if key is the first data of p // return p // move p to next // elese return NULL