explain linked lists returning a node address

with following function prototype and structure of linked list, how do i write function to return an address/? I think what I got is wrong. please help

prototype:

struct node *search(struct node *start,int n);

structure:

struct node { int value; struct node * next;};

Code:

---

struct node *search(struct node *start,int n)
{

  if ( n = node->value) 
    return node;
  else
    return (\0);
}

---

Nope, that's correct. If you want to return a pointer to a structure, you just do:

return node;

Quzah.

i should be explicit in what the function needs to do:

• if value n is found in some node, return address of this node
• if value n is not found, return null pointer

so is what i have okay??

Right. That's what you want. That's what you've got.

Code:

---

Node *myFunc( Node* searchHere, int findThis )
{
    Node *n;
    for( n = searchHere; n; n = n->next )
        if( n->value == findThis )
            return n;
    return NULL;
}

---

That's exactly what you have. You're doing it right.

Quzah.