Breadth First Search

Create a Linked List of all the nodes at each depth in Binary Tree

Problem Given a binary tree, design a algorithm which creates a linked list of all the nodes at each depth (e.g, if you have a tree with depth D, you'll have D linked lists) How to Solve The important point of the this problem How we shoul…

Find out whether there is a routes between two nodes

Problem Given a directed graph, design an algorithm to find out whether there is a route between two nodes. How to Solve This problem can be solved by depth first search or breadth first search. While traversing the graph, we have to contr…