• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Data Structures | Linked List | Question 2

Which of the following points is/are true about Linked List data structure when it is compared with array?

(A)

Arrays have better cache locality that can make them better in terms of performance.

(B)

It is easy to insert and delete elements in Linked List

(C)

Random access is not allowed in a typical implementation of Linked Lists

(D)

The size of array has to be pre-decided, linked lists can change their size any time.

(E)

All of the above

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments