Aditya Raj

We have already discussed binary trees and binary search trees in previous posts. In this article, we will formulate an algorithm to Delete a Binary Tree without causing a memory leak. We will also implement the algorithm in Python. What…

In this article, we will modify the level order tree traversal algorithm to find the maximum width of a binary tree. In the previous post on balanced binary trees, we have formulated and implemented an algorithm to find the height of…

In this article, we will use this algorithm to find the sum of all nodes in a binary tree. We have already discussed the Level Order Binary Tree Traversal in Python. How to find the sum of all nodes in…

Graph traversal algorithms have various applications. One of the applications is to find the least distance between two nodes of a graph. In this article, we will implement an algorithm to find the least distance in an unweighted, fully connected…

Depth-first search is a traversal technique in which we traverse a graph and print the vertices exactly once. In this article, we will study and implement the depth-first search for traversing graphs in python. Recommended read: Implementing a graph in…

Breadth-first search is a traversal technique in which we traverse a graph and print the vertices exactly once. In this article, we will study and implement the breadth-first search for traversing graphs in python. What is the Breadth-First Search Algorithm?…

In this article, we will discuss how to perform different graph operations. Graphs are nonlinear data structures that consist of vertices and edges. They’re used to represent maps between cities, social media connectivity of users, and connectivity of web pages,…

A graph is a data structure used to illustrate connections between two objects. A simple example of a graph is a geographical map in which different places are connected by roads. In this article, we will study the theoretical aspects…

In this article, we will learn more about Min Heap (known as heap queue in Python). We have already learned about Heap and its library functions (in heapq module) in python. We will now learn about min-heap and its implementation…

In this article, we will learn more about Max Heap (known as heap queue in Python). We have already learned about Heap and its library functions (in heapq module) in python . We will now learn about max heap and…