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
You might also like to view...
List all classes (course_no, section_no) taught by Fernand Hanks (Use a correlated subquery) .
What will be an ideal response?
Each key thought of a presentation should be a separate, new slide
Indicate whether the statement is true or false
In SharePoint, ________ are created with unique names to represent multiple people, or individual users, within the organization
Fill in the blank(s) with correct word
Which of the following best describes WordArt?
A. A diagram that illustrates a concept or idea B. Decorative text C. A text box that includes a quotation D. A picture