## Efficiently print all nodes between two given levels in a binary tree

Given a binary tree, efficiently print all nodes between two given levels in a binary tree. The nodes for any level should be printed from left to right.

Coding made easy

Given a binary tree, efficiently print all nodes between two given levels in a binary tree. The nodes for any level should be printed from left to right.

In this post, we will see how to implement a queue using stack data structure in C++ and Java. In other words, design a queue that supports enqueue and dequeue operations using standard push and pop operations of the stack.

Given a multilevel linked list, convert it into a singly linked list in such a way that all nodes of first level appears first, followed by all nodes of second level, and so on. The multilevel linked list is similar to the simple linked list except that it has one extra field which points to …

Given a weighted digraph (Directed Graph), find the least cost path from given source to destination that have exactly m edges.

Given a weighted graph, find the maximum cost path from given source to destination that isÂ greater than a given integer x. The path should not contain any cycles.

In this post, we will see how to traverse the given directory and list out all files present in it and all its sub-directories.

Given a binary tree, write an efficient algorithm to compute maximum width of it.

Consider a directed graph where 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.

Given a binary tree, write an efficient algorithm to invert binary tree.

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, we need to find shortest distance of every open cell in the maze from its nearest mine.

Given a binary tree, print corner nodes of every level in it.

Given a binary tree, print all nodes for each diagonal having negative slope (\). Assume that the left and right child of a node makes 45 degree angle with the parent.