A general linked list is an important data structure because:
A. it can conserve more memory than an array for large element sizes
B. it is much faster than an array in almost every possible situation
C. without one, there are no data structures available for which we could search for keys
D. it is the only data structure in which each element can be a record of information
A
Computer Science & Information Technology
You might also like to view...
Trust relationship among domain trees needs to be established explicitly or implicitly to build a domain forest
a. true b. false
Computer Science & Information Technology
What clause sorts the rows returned?
a. GROUP BY b. FROM c. WHERE d. ORDER BY
Computer Science & Information Technology