question about your remove function

[atv2016]

Hi Karlina,
What does p=q do ? Does p stand for pointer and q for query?

while (q)
{
if (count == position)
{
p -> next = q -> next; <- This i get
delete q;
listLength--;
cout << "Success: node at position " << position << " was deleted." << endl;
cout << "listLength = " << listLength << endl;
return true;
}
p = q; <- What is happening here?
q = p -> next;
count++;

[seancyw]

@atv2016 Hi, the
p = q
is used to assign the current node to the previous node.
Assuming you are on "HEAD" node for start. You will assign the "HEAD" node from 'q' to 'p'. On the next lines, you will be assigning the first node ("NEXT" node) of "HEAD" node to it and increment the 'count'. So, on the second iteration, if the current count is not equivalent to position we want. It will assign the first node from q to p. And next lines
q = p -> next;
will be assign the second node ("NEXT" node) of first node and increment the count. These steps will be repeat until you reach your desired position. Hope this would help :)