I'm new also but i think this is about what you are trying to do
Code:
int location; // which list do you want to access?
int ctr; // needs a counter to keep track of the list we are currently in
node* conductor = head; // start at the beginning
for(ctr = 1; ctr != location; ctr++) //run this loop until you are at the nth list
{
if(conductor->next == (node*)NULL) // seeing if there is a next list
{
// location does not exist, insert some error handling stuff
break;
}
conductor = conductor->next; // moving thru the next link
}
if((ctr == location) && (conductor != (node*)NULL)) // pointer is good, and we should be in the right list
{
return conductor->data; // return some data
}