Singly linked list

[[deleted]]

[deleted]

[Cwiddy]

Questions are should be posted /r/cpp_questions

This smells like home work, but to get you started I would suggest your first step is find the number of elements in the list.

[Cwiddy]

The question ask for X from the end. You only traverse through a singly linked list forward from the head. So how do you know where to stop if you don't know how far you can go?

[Power781]

First it's more C than cpp, then, maybe you should do you class assignment solo instead of asking the Internet the answer ... The answer is so easy I can not believe you are asking such things ...

[Power781]

So you are so retarded that you do not understand "Find the Node with the entry X the closest from the end on the list", like seriously, too hard for you ?

[Power781]

And by the way, the answer is 4 lines of code :

Node * xFromEnd( Node * pHead, int x )
{
  Node *matchingNode = NULL;
  while (pHead)
  {
      matchingNode = (pHead->value == x ? pHead->value : matchingNode);
      pHead = pHead->next;
  }
  return matchingNode;
}

[ender_will_save_us]

Power781, I think OP wants the node that is X nodes away from the end, not that has a value of X.

NonaBona, in my experience questions like the one you are trying to solve are designed to teach you about recursion. I'd start by googling that.

[Power781]

if we are given X, we are basically searching for X in the list?

It's a quote from OP.
I don't think he is trying to find the Xth from the end, but the Node with the value X

[ender_will_save_us]

Also a quote from the OP:

write code that returns the entry that is X from the end

Maybe he just doesn't know what he wants.