A list can be considered a recursive data structure because
A) list classes implement list interfaces
B) list objects are instances of list classes
C) if you remove the head of the list,what remains is also a list
D) None of the above: only methods can be considered recursive.

Question

Quizplus · Accepted Answer

A list can be considered as a recursive data structure because if you remove the head of the list, what remains is also a list. This self-similarity property is a characteristic of recursive data structures. Options A and B are incorrect as they merely define the characteristics of list classes and list objects. Option D is incorrect as both data structures and methods can be recursive.

A List Can Be Considered a Recursive Data Structure Because