63. Print Right View of Binary Tree

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

What is the Right View of a Binary Tree?

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

Example:

Approach :

• The idea is to traverse the tree from right to left and print the first node you encounter at each level.
• To implement the above
  • Take two variables, currentLevel = 0 and nextLevel=0
  • Every time you go left or right, nextLevel by 1. 
  • If current level<nextLevel, print the node and set currentLevel = nextLevel. This way you will print only the first node you encounter at each level

Note: Another approach would be to Do the Level order traversal from left to right and print the last node value

5 15 35 45

Related Problems:

- Dynamic Programming - Maximum Product Cutting Problem Medium
- Binary Search Beginner
- Inorder Successor in Binary Search Tree without Using Parent link Hard
- Find all subsets of size K from a given number N (1 to N) Medium
- Given an array, Print sum of all subsets Beginner