Multiple Choice
A systematic procedure for starting at the first node in a list,and visiting all nodes in the list by going from each node to its successor is called
A) a sweep
B) a traversal
C) travelling over the list
D) All of the above
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q24: A doubly circularly linked list makes it
Q25: A linked list class keeps its elements
Q26: The objects that form the units of
Q27: A linked list class uses a Node
Q28: A doubly linked list makes it easy
Q30: In a linked list,the predecessor of a
Q31: To remove a node with a positive
Q32: To allocate storage for its elements,an array-based
Q33: A linked list class uses a Node
Q34: In a linked list,the successor of a