Least cost path in a digraph from a given source to a destination having exactly `m` edges
Given a weighted digraph (directed graph), find the least-cost path from a given source to a given destination with exactly m edges.
Tag: Breadth-first search
Find maximum cost path in a graph from a given source to a given destination
Given a weighted graph, find the maximum cost path from a given source to a destination that is greater than a given integer k. The path should not contain any cycles.
Print right view of a binary tree
Given a binary tree, write an efficient algorithm to print its right view. For example, the right view of a given binary tree is 1, 3, 6, 8.
Traverse a given directory using BFS and DFS in Java
This post will discuss how to traverse the given directory and list out all files present in it and all its sub-directories using BFS and DFS.
Compute the maximum number of nodes at any level in a binary tree
Given a binary tree, write an efficient algorithm to compute the maximum number of nodes in any level in the binary tree.
Compute the least cost path in a weighted digraph using BFS
Consider a directed graph where the weight of its edges can be one of x, 2x, or 3x (x is a given integer), compute the least-cost path from source to destination efficiently.
Invert Binary Tree – Iterative and Recursive Solution
Given a binary tree, write an efficient algorithm to invert it.
Find the shortest distance of every cell from a landmine inside a maze
Given a maze in the form of a rectangular matrix, filled with either O, X, or M, where O represents an open cell, X represents a blocked cell, and M represents landmines in the maze, find the shortest distance of every open cell in the maze from its nearest mine.
Print corner nodes of every level in a binary tree
Given a binary tree, print corner nodes of every level in it.
Print diagonal traversal of a binary tree
Given a binary tree, print all nodes for each diagonal having negative slope (\). Assume that the left and right child of a node makes a 45–degree angle with the parent.
Perform vertical traversal of a binary tree
Given a binary tree, perform vertical traversal on it. In vertical traversal, nodes of a binary tree are printed in vertical order. Assume that the left and right child makes a 45–degree angle with the parent.
Check if a binary tree is a complete binary tree or not
Given a binary tree, check if it is a complete binary tree or not. A complete binary tree is a binary tree in which every level, except possibly the last, is filled, and all nodes are as far left as possible.