# Aditya Raj

I am currently pursuing Bachelor of Technology and MBA (dual degree) in Information Technology from Indian Institute of Information Technology. I love teaching and writing articles on computer science and related topics.

## Depth-first search in a graph

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 Python What is the Depth-First Search Algorithm? In a depth-first search, we traverse each vertex …

## Breadth-First Search in a Graph

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 breadth-first search, we traverse each vertex of the graph exactly once by starting from …

## Graph Operations in Python [With Easy Examples]

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, etc. Working on Graph Operations If you have not studied the implementation of a graph, …

## Implementing a Graph in Python

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 of a graph data structure. Additionally, we will implement a graph using two different methods.  …

## Min Heap Data Structure – Complete Implementation in Python

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 and then look at the Python code for implementing the heapify, heappush and heappop functions …

## Max Heap Data Structure – Complete Implementation in Python

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 its implementation and then look at the Python code for implementing the heapify, heappush and …

## Heaps in Python

In this article, we will learn about an important Data Structure, Heaps in Python (known as heap queue in Python). We will learn about the data structure and its implementation and then look at the Python code for the same. What are Heaps in Python? Heaps in Python are complete binary trees in which each …

## Level Order Binary Tree Traversal in Python

In this article, we will learn about the level order binary tree traversal. First We will look at the underlying concepts behind level order traversal and then we will implement level order traversal for binary trees in python. What is Level Order Traversal? Level order traversal is a breadth-first binary tree traversal technique. We first …

## Postorder Tree Traversal in Python

In this article, we will study the concept and algorithm for postorder tree traversal. Then we will implement the algorithm for postorder traversal in python and run it on a binary tree. What is Postorder Tree Traversal? Postorder traversal is a depth-first tree traversal algorithm. In depth-first traversal, we start at the root node and …

## Inorder Tree Traversal in Python [Implementation]

In this article, we will study the concept and algorithm for inorder tree traversal. Then we will implement the algorithm for inorder traversal in python and run it on a binary search tree. What is Inorder Tree Traversal? Inorder Traversal is a depth first tree traversal algorithm. In depth first traversal, we start at the …