top of page
Blogs


Dijkstra’s Shortest Path Algorithm with Examples
A shortest path algorithm is an algorithm used to find the shortest path between two nodes in a graph. Here the edges connecting the...
Pushp Raj
Apr 26, 20234 min read
Â
Â


Depth-first Search (DFS) Algorithm With Example
What is a Graph Traversal Algorithm? Graph traversal is a search technique for finding a vertex in a graph. In the search process, graph...
Pushp Raj
Apr 21, 20234 min read
Â
Â


Breadth First Search (BFS) Algorithm with Example
An algorithm is a set of instructions that you follow to solve a problem or achieve a desired result. You can use them to solve math...
Pushp Raj
Apr 18, 20235 min read
Â
Â


Types of Sorting in Data Structures
Sorting is the operation performed to arrange the records of a table or list in some order according to some specific ordering criterion....
Pushp Raj
Apr 16, 20239 min read
Â
Â


Tree Data Structures: Binary Search Tree, AVL Tree & More
WHAT IS A TREE? Trees are non-linear hierarchical data structures. A tree is a collection of bumps connected by directed or undirected"...
Pushp Raj
Apr 14, 20237 min read
Â
Â


What is linear and binary search? : Implementation, Difference, and More
Searching a data structure refers to finding a desired element in a set of elements. The desired item is called a "target". The set of...
Pushp Raj
Apr 13, 20238 min read
Â
Â


What is Priority Queue? | Queue - 2
What is Priority Queue? A priority queue is a data structure that allows efficient retrieval and insertion of items based on priority....
Pushp Raj
Apr 1, 20235 min read
Â
Â


Introduction to Queue – Data Structure and Algorithm Tutorials
Queues are data structures and algorithms used to store and process data in a particular order. This follows the FIFO (first in, first...
Pushp Raj
Mar 25, 20235 min read
Â
Â
bottom of page