Question

a data structure in which linear sequence is maintained by pointers is known as? ​

Answer 1

Explanation:

Explanation:A data structure in which linear sequence is maintained by pointers is known as. (A) Array.

Answer 2

Answer:

A linked List is a data structure in which a linear sequence is maintained by pointers.

Explanation:

Linked List

A linked list is a linear data structure in which elements are stored in non-contiguous locations and accessed by pointers.

A linked list is a better option than an array if you have to access any element randomly. We can access any element in constant time by using a linked list. However, the drawback of the linked list is that insertion and deletion operations are complex because pointers are complicated to handle.

For example:

2-> 3->7->9

These four elements are sequentially stored and can be accessed by the pointers only. It may possible that elements have different memory addresses.

#SPJ2