Question

Write three distinct differences between Array and Linked List.

Answer 1

Sr. No.	Array	Linked List
(i)	A data structure made up of a finite, ordered collection of uniform data elements is called a linear array.	One type of linear data structure is a linked list. This is made up of a group of "data elements" known as nodes, where pointers are used to maintain line order.
(ii)	An array's components are kept in arranged memory regions.	It is not necessary for linked list elements to be kept in consecutive memory locations.
(iii)	Inspection of a complex procedure's element within an array.	An element in a linked list is simple to inspect.
(iv)	Proays are difficult to extend.	It is simple to extend a linked list.
(v)	E.g. int A [3]; Here, 0 and 1 are successively consecutive places. It is the array name that has all of the integers in it.	E.g.  Here, 10, 13, and 19 are non-consecutive, random locations. In Link art, the node data for "A," "C," and "B" is followed by the address of the node after it.