Data Structures and Algorithms in Real Life examples

Array :
2D arrays (matrices) are mainly used in Image Processing.
RGB image uses a 3D matrix.
2D arrays are also used in Game Design like Sudoku, Chess.
The Leader Board of game or coding contest.

Stack :
Used in backtracking, check valid parenthesis in an expression.
Evaluating Infix and Postfix expressions.
Used in Recursive function calls to store function calls and their results.
Undo and Redo operations in word processors like MS-Word, and Notepad.
Browsing history of visited websites.
Call history/log in mobile phones.
Java Virtual Machine uses a stack to store immediate calculation results.

Queue:
Windows operating system uses a circular queue to switch between different applications.
Used in First Come First Serve job/CPU scheduling algorithm which follows FIFO order.
All the requests are queued for the server to respond.

Priority Queue :
A priority queue is used in priority scheduling algorithm and interrupt handling in OS.
Used in Huffman Coding in compression algorithms.

Linked List:
Previous and Next Page in Web Browser.
Songs in the music player are linked to the previous and next songs using doubly linked list.
Next and previous images in a phone gallery.
Multiple Applications running on a PC uses circular linked list.
Used for the implementation of stacks, queues, trees, and graphs.

Graph :
In Facebook, LinkedIn and other social networking sites, users are considered to be the vertices and the edge between them indicates that they are connected.
Facebook’s Graph API and Google’s Knowledge API are the best examples of grpah.
Google Maps, Yahoo Maps, Apple Maps uses graph to show the shortest path using Breadth First Search (BFS).
Used in HTML DOM and React Virtual DOM.

Tree :
Representation structure in File Explorer. (Folders and Subfolders) uses N-ary Tree.
Auto-suggestions when you google something using Trie.
Used in decision-based machine learning algorithms.
Used in Backtracking to maintain the state-space tree.
A binary tree is used in database indexing to store and retrieve data in an efficient manner.
To implement Heap data structure.

Binary Search Trees: (BST) can be used in sorting algorithms.

Dijkstra Algorithm :
This algorithm is used to find the shortest path between two vertices in a graph in such a way that the sum of weights between the edges is minimum.

Prims Algorithm :
It is a greedy algorithm to obtain a minimum spanning tree.