Algorithm

Data Structure

Database

Array

Linear data structure

Static data structure

Non-linear data structure

Dynamic data structure

Logarithmic Data Structure

Array

Queue

Tree

Linked list

tree - graph

array - tree

graph - linked list

tree - queue

Array is a dynamic data structure

Arrays don't use an index-based data like trees.

Store multiple values of the same data type

The search process in an array can't be done very easilyThe search process in an array can't be done very easily

A linked list uses extra memory to store links.

The first node of the linked list is called the Head

During initialization of linked list, you need to know the size of the elements.

Each node of the linked list consists of a pointer/link which is the address of the next node.

Stack is a linear data structure that follows a particular order in which the operations are performed.

Stack is implemented through array or linked list.

The insertion and deletion happens at two end, from the top of the stack and front.

Stack is a Last In First Out operation.

Queue is a non-linear data structure that follows a particular order in which the operations are performed. 

Queue is a First In First Out(FIFO) structure.

To remove the last element of Queue, all the elements inserted before the new element in the queue must be removed.

Queues are used for job scheduling in operating system.

A tree is a non-linear and hierarchal data structure where the elements are arranged in a tree-like structure. 

Topmost node is called as a root node.

Tree is also known as a recursive data structure.

Tree has an index like arrays.

A graph is a non-linear and static data structure that consists of vertices (or nodes) and edges.

A social network is also one real-world example of a graph where every person on the network is a node

Graph is used to solve the most challenging and complex programming problems

One of the most common real-world examples of a graph is Google Maps