Objective 13

 Data structures

Data structures are ways of organizing and storing data on a computer so that it can be accessed and manipulated efficiently. They provide a means to manage and organize data effectively.

Characteristics

 Data structures can have various characteristics, such as being linear or nonlinear, static or dynamic, and homogeneous or heterogeneous.

Classification

 Data structures can be classified into two main categories: primitive data structures (such as integers, floats, etc.) and composite data structures (such as arrays, lists, trees, etc.).

Arrays: A collection of elements of the same data type stored in contiguous memory locations and accessed via an index.

Linked Lists: A sequence of nodes where each node contains a value and a reference to the next node in the sequence.

Stacks: A data structure in which elements are inserted and removed according to the Last In, First Out (LIFO) principle.

 

Queues: Similar to a stack, but follows the First In, First Out (FIFO) principle, where elements are removed in the same order they were inserted.

Trees: Hierarchical structures consisting of nodes connected to each other via links. Some common types of trees include binary trees, binary search trees, AVL trees, among others.

Next to objetive 14

                                                                                                Return index