Print Right View of a given binary tree

Objective: In a Binary Tree, print right view of it

Input: A binary tree.

What is Right View of a binary Tree?

When just look at the tree from the right side , all the nodes you can see will be the right view of the tree.


Right View of a binary tree
Right View of a binary tree

Approach :

Method 1 :

  • Traverse the tree from right to left
  • Print the first node you encounter
  • Take two variables , currentLevel=0 and nextLevel=1
  • As soon as you change level , change the currentLevel = nextLevel
  • Print only when current level<nextLevel so this way you will print only the first element
  • For rest of the nodes on the the level currentLevel and nextLevel are equal so it wont print

Method 2:

Do the Level order traversal and print the last node value

Complete Code:

public class RightViewOfTree {
public static int currentLevel =0;
public void rightViewRecur(Node root, int nextLevel){
if(root==null) return;
System.out.print (" " +;
currentLevel = nextLevel;
public static void main (String[] args) throws java.lang.Exception
Node root = new Node(5);
root.left = new Node(10);
root.right = new Node(15);
root.left.left = new Node(20);
root.left.right = new Node(25);
root.right.left = new Node(30);
root.right.right = new Node(35);
root.left.right.right = new Node(45);
RightViewOfTree i = new RightViewOfTree();
class Node{
int data;
Node left;
Node right;
public Node(int data){ = data;
this.left = null;
this.right =null;


5 15 35 45

Leave a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.