When searching a linked list, we do not move the start pointer through the list because:
A. it would result in memory leak
B. it is faster to use another pointer other than start
C. pointers that move through linked lists are disruptive
D. it is never necessary to move a pointer through a linked list; the linked list can be searched by simply examining each node for the needed information
A
Computer Science & Information Technology
You might also like to view...
The Security bar alerts you when workbooks contain macros and allow you to enable or disable them
Indicate whether the statement is true or false.
Computer Science & Information Technology
Describe the Internet Protocol Suite.
What will be an ideal response?
Computer Science & Information Technology