## Print Right View of a Binary Tree

Given a binary tree, write an efficient algorithm to print right view of given binary tree.

Coding made easy

Given a binary tree, write an efficient algorithm to print right view of given binary tree.

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.

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

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.

Given a binary tree, check if it is a complete binary tree or not.

Given a binary tree and a node in it, write an efficient algorithm to find its next node in same level as given node.

Given a binary tree, write an efficient algorithm to print left view of binary tree.

Given a perfect binary tree, write an efficient algorithm to print all nodes of it in specific order. We need to print nodes of every level in alternating left and right.

Given a binary tree, print its nodes level by level in reverse order. i.e. all nodes present at last level should be printed first followed by nodes of second-last level and so on.. All nodes for any level should be printed from left to right.

Given a binary tree, print its nodes level by level in spiral order. i.e. all nodes present at level 1 should be printed first from left to right, followed by nodes of level 2 right to left, followed by nodes of level 3 from left to right and so on.. In other words, odd levels …