Mutable vs Immutable datastructures

Mutable vs Immutable datastructures: Pros and Cons


Mutable vs Immutable datastructures are part of most of the programming languages so it is important to know how they behave, their strong and weak points. This blog is divided into two parts and it will talk about difference between the two parts. First part majorly deals with the benefits and drawbacks of immutability. Lets

Breadth-first search in a graph with python

Breadth-first search in a graph with python


In Implementing graph with python and how to traverse we learn how we can implement graph with python. In this article, we are going to talk about the breadth-first search and how we can achieve it using python. If you haven’t read about implementing a graph with python read it here. If you have read

Implementing graph with python

Implementing graph with python and how to traverse.


When we talk about algorithms, graphs are one of the most important parts to know about. In this session, we will talk about graphs and implementing graph in python. What is a graph? A graph is a data structure consists of nodes and edges. It is nonlinear and can form very complex structures. If you

Algorithms: Mirror a Binary tree using python

Algorithms: Mirror a Binary tree using python


In this article we are going to see how we can mirror a binary tree using python. Lets see what are binary tree Algorithms: Mirror a Binary tree using python  Binary tree are the tree where one node can have only two child and cannot have more than two. Traversal means visiting all the nodes

Major algorithms asked during Interviews.

Major algorithms asked during Interviews.


Here I am going to mention the list of major algorithms asked during Interviews. You can find the list as below. Major algorithms asked during Interviews. Below are the books I highly recommend for algorithms Graph 1. Breadth First Search (BFS) 2. Depth First Search (DFS) 3. Shortest Path from source to all vertices **Dijkstra**