Question

Explain the category in which data structure can be divided

Answer 1

Answer:

The data structure can be subdivided into major types: Linear Data Structure. Non-linear Data Structure.

...

The common examples of the linear data structure are:

Arrays.

Queues.

Stacks.

Linked lists.

I think I should be right

Answer 2

The category in which data structure can be divided

Basically, there are two classifications for data structures:

Linear data structure. Non-linear data structure.

• Data elements in a linear data structure are progressively connected and can all be traversed in a single run. Data elements are hierarchically related and appear at different levels in a non-linear data structure Degrees. All data elements in a linear data structure are found at the same level.
• The data pieces of a data structure known as t don't always remain in a linear or sequential order.
• There is not a single level involved because the data structure is non-linear. As a result, a user cannot visit every element of it in a single run.
• Linked lists, Stacks, Queues, Arrays, and other linear data structures are all examples.

#SPJ2