Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
7 views1 page

Intro to Linear Data Structures

Uploaded by

cinemanews466
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views1 page

Intro to Linear Data Structures

Uploaded by

cinemanews466
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

1.

Linear Data Structure: Data structure in which data elements are arranged sequentially or
linearly, where each element is attached to its previous and next adjacent elements, is called
a linear data structure.
Example: Array, Stack, Queue, Linked List, etc.

2. Static Data Structure: Static data structure has a fixed memory size. It is easier to access the
elements in a static data structure.
Example: array.

3. Dynamic Data Structure: In dynamic data structure, the size is not fixed. It can be randomly
updated during the runtime which may be considered efficient concerning the memory
(space) complexity of the code.
Example: Queue, Stack, etc.

4. Non-Linear Data Structure: Data structures where data elements are not placed sequentially
or linearly are called non-linear data structures. In a non-linear data structure, we can’t
traverse all the elements in a single run only.
Examples: Trees and Graphs.

5. 1. Array:
6. Array is a linear data structure that stores a collection of
elements of the same data type. Elements are
allocated contiguous memory, allowing for constant-
time access. Each element has a unique index number.

You might also like