Vijay Sinha

Hierholzer’s Algorithm with Implementation in Java

In this article, will look at an interesting algorithm related to Graph Theory: Hierholzer’s Algorithm. We will discuss a problem and solve it using this Algorithm with examples. We will also discuss the approach and analyze the complexities for the solution. Hierholzer’s Algorithm has its use mainly in finding an Euler Path and Eulerian Circuit …

Hierholzer’s Algorithm with Implementation in Java Read More »

Boruvka’s Algorithm with Implementation in Java

In this article, we will have a look at another interesting algorithm related to Graph Theory – Boruvka’s Algorithm. We will also look at a problem with respect to this algorithm, discuss our approach and analyze the complexities. Boruvka’s Algorithm is mainly used to find or derive a Minimum Spanning Tree of an Edge-weighted Graph. …

Boruvka’s Algorithm with Implementation in Java Read More »

Balanced Binary Tree – Definition, How to Check, Time & Space Complexity

In this article, we take a look into an important type of Binary Tree based Data Structure – Balanced Binary Tree. We will discuss the description of balanced binary trees with examples. Along with this, we will also look at an interesting problem related to it. Definition A Balanced Binary Tree commonly referred to as …

Balanced Binary Tree – Definition, How to Check, Time & Space Complexity Read More »