answer for my qyestion........its very urgent

[rajareddy]

//Implement the following List functions
void ListPrint()
{
//print out all the list
}
void ListRemove(List *node)
{
//given a node, remove it from the linklist
}
void ListRemoveTail()
{
//remove the last node from the tail
}
void ListRemoveHead()
{
//remove the node from head
}
int ListCount()
{
//get the total number of nodes in the list
}
int ListRemove(List *start, List *end)
{
//given the start node and end node, remove all the nodes between start and end
//you can assume start and end are valid nodes,
//you need to delete end node, but not the start node
}

[sicarie]

I'm sorry, I seem to have missed the question in there.

In the meantime, have a look at this, and specificially this .

[niskin]

I'm afraid we can't do it for you, so you need to be more specific in what you are asking, and if you haven't already, have a go at it yourself.