## BFS & DFS

A traversal is a systematic walk which visits the nodes of the graph in a specific order. Two Types:- 1.Breadth First Traversal 2.Depth First Traversal Breadth ...

Skip to content
# Tag: search

## BFS & DFS

A traversal is a systematic walk which visits the nodes of the graph in a specific order. Two Types:- 1.Breadth First Traversal 2.Depth First Traversal Breadth ...

## Binary Search

All's the Code !

This is a short note on using binary search, in continuance of my series on Algorithms. Suppose we have to find whether a particular element exists in the sorte...