[Introduction] Data Structure and Types

1. What is Data Structures?

Data Structure is a storage that is used to store and organize data. It is a way of arranging data on a computer so that it can be accessed and updated efficiently.

 

Depending on your requirement and project, it is important to choose the right data structure for your project. For example, if you want to store data sequentially in the memory, then you can go for the Array data structure.

 

2. Linear Data Structure

In linear data structrue, the element are arranged in sequence one after the other. Since elements are arranged in particular order, they are easy to implement.

 

However, when the complexity of the program increase, the linear data structures might not be the best choice because of operational complexitiyes.

 

2.1 Array Data Structure

In an array, elements in memory are arranged in continuous memory. All the elements of an array are of the same type. And the type of elements that can be stored in the form of array is determined by the programming language. In Python, we can use list as array.

 

2.2 Stack Data Structure

In stack data structure, elements are stored in the LIFO principle. That is, the last element stored in a stack will be removed first.

 

It works just like a pile of plates where the last plate kept on the pile will be removed first.

 

2.3 Queue Data Structure

Unlike stack, the queue data structure works in the FIFO princple where first element stored in the queue will be remove first.

 

2.4 Linked List Data Structure

In linked list data structure, data element are connected through a series of nodes. And, each node contains the data items and address to the next node.

 

3. Non Linear Data structure

Non linear data structure are arranged in a hierarchical manner where one element will be connected to one or more elements.

 

3.1 Graph Data Structure

In graph data structure, each node is called vertex and each vertex is connected to other vertices through edges.

 

• Spanning Tree and Minimum Spanning Tree
• Strongly Connected Components
• Adjacency Matrix
• Adjacency List

3.2 Tree Data Structure

Similar to a graph, a tree is also a collection of vertices and edges. However, in tree data structure, there can only be one edges between two vertices.

• Binary Tree
• Binary Search Tree
• AVL Tree
• B-Tree
• B+Tree
• Red-Black Tree

 

4. Source

https://www.programiz.com/dsa/data-structure-types

Data Structure and Types