## 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

Read more
Skip to content
# DS / Algo

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

##
Prim’s Algorithm

##
Maximum Product of Two Integers in an Array

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

##
Find equilibrium Index of an Array

##
Dijkstra Algorithm

##
Ford-Fulkerson Algorithm

##
Binary Search

##
Linear Search

##
Greedy Algorithm

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

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

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

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

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

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

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

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

Read moreLinear Search Linear search is a sequential searching algorithm that is we start from one end and check each

Read moreGreedy Algorithm Greedy algorithm is builds up a solution piece by piece, always choosing the next piece that offers

Read more