Sahithyan's S2 — Data Structures and Algorithms

Introduction to Data Structures

Revise S1 for data structures. Defines how data is stored in the computer.

Array

A fixed-size linear collection of elements. The elements are placed next to each other in continuous memory.

A linear collection of elements. The elements are placed in non-continuous memory and the order is preserved using “links”.

Each element stores the pointer to the next element. Last element points to null.

Each element stores the pointer to both the previous and the next element. First element’s previous element and last element’s next element are null.

Works as LIFO.

Works as FIFO.