It's a memory vs speed trade off. For the cost of one more pointer per node, I can now instantly remove that node or insert before or after that node, without having to loop through the whole list to...
Type: Posts; User: quzah
It's a memory vs speed trade off. For the cost of one more pointer per node, I can now instantly remove that node or insert before or after that node, without having to loop through the whole list to...
Another thread successfully high-jacked! Well done, drinks all around!
Quzah.
I would totally build a faraday cage into the walls of my house if I was building a new one. Not even joking.
Quzah.
Yeah but that would be 4 uncool months!
Quzah.
It moves through the linked list. Let's say you have already set up 3 nodes.
root->next = node1, node1->next = node2;So let's see what it does:
conductor = root;
if( conductor != NULL ) /* it's...