When searching for a node in a linked list to remove, we use a loop to move a pointer through the list. We want the pointer to stay one node in front of the node we wish to remove because:
A. we have to link the node to remove to the node in front of it
B. we have to link the node in front of the node to remove to the node after the node to remove (if there is one)
C. if we did not, there would be memory leak for the node in front of the node to remove
D. we cannot free the node to remove if the pointer is pointing to it
B
Computer Science & Information Technology
You might also like to view...
The ________ value is entered automatically when a new record is created
Fill in the blank(s) with correct word
Computer Science & Information Technology
Describe an advantage of each of the following training formats: classes, small groups, one-to-one, and self-guided tutorial.
What will be an ideal response?
Computer Science & Information Technology