Data Structures

Topological Sort in Data Structures

Topological Sort is a linear ordering of vertices in a Directed Acyclic Graph (DAG) such that for every directed edge […]

Dijkstra Algorithm is used to find the shortest path from a source node to all other nodes in a weighted

Depth First Search (DFS) is a graph traversal algorithm that explores nodes as deep as possible before backtracking. It uses

Breadth First Search (BFS) is a graph traversal algorithm that visits nodes level by level using a queue (FIFO). It

Graph Representation in Data Structures – When we work with graphs in programming, we need a way to store the

A Graph is a nonlinear data structure used to represent connections between different things. Unlike trees, a graph does not

A Heap is a special tree-based data structure that follows a very simple rule: The parent node is always greater

An AVL Tree is a self-balancing Binary Search Tree (BST). In a normal BST, the tree can become unbalanced, which

A Binary Search Tree (BST) is a special type of Binary Tree. In a BST, data is stored in a