## Check if each node of a binary tree has exactly one child

To check if each node of a binary tree has exactly one child following is the example to Check if

## Prim’s Algorithm

Prim’s Algorithm Prim’s algorithm is aused to find minimum spanning tree algorithm that takes a graph as input and this

## Maximum Product of Two Integers in an Array

Maximum Product of Two Integers in an Array The purpose of this post is to find a maximum product of

## Binary Search in C++ STL and Java Collections

Binary Search in C++ STL and Java Collections This post is about describing binary search in C++ STL and Java

## Find equilibrium Index of an Array

Equilibrium Index of an Array The purpose of this post is to explain and find equilibrium index of an array

## Dijkstra Algorithm

Dijkstra Algorithm   Dijkstra algorithm is a single source shortest path algorithm and  single-source means their only one source is

## Ford-Fulkerson Algorithm

Ford-Fulkerson Algorithm Ford-Fulkerson algorithm is a greedy approach to calculating the maximum possible flow in a graph or a network.

## Binary Search

Binary Search   Binary search is the technique in which works efficiently on sorted lists. So, to search an element