• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Right view of Binary tree

July 24, 2016 by Dhaval Dave

We are given a Binary Tree, Print the Right view of Binary tree,
Right view of binary tree is  : List of all nodes which are visible If you look at Binary tree from right side.
For example,

Right view of following tree is a, c, g, h  

          a
       /     \
     b        c
   /   \     /  \
  d     e   f    g
                  \
                   h

Hint for logic :

First Simple Method for Right view of Binary Tree:

  • Tra­verse the Binary tree from right to left
  • Print the first “node->data” you encounter
  • Take two vari­ables , currentLevel=0 and nextLevel=1
  • when you change level , change the cur­rentLevel = nextLevel
  • Print node->data only when cur­rent level<nextLevel to print only the first element in the right.
  • For rest of the nodes on the the level cur­rentLevel and nextLevel are equal so it wont print.

Second Method : Level Order Traversal for Right view of Binary Tree:

If you Print a Tree in breadth first search manner, then it will print
a,   b,  c,  d,  e,  f,  g,  h, now the list of nodes we visit the last in each breadth  is required list.

Lets Code given problem

Recursive way

 

void rightViewUtil(struct Node *node, int bredth, int *m_l){
    if (node==NULL) return;
    // Check If current node is the last one of its level/breadth
    
   if (*m_l < bredth){
       printf("%d\t", node->data);
       *m_l = bredth;
    }

   // Recursion for right subtree and then left subtree
   rightViewUtil(node->right, bredth+1, m_l);
   rightViewUtil(node->left, bredth+1, m_l);
}

void rightView(struct Node *node){
    int max_level = 0;
    rightViewUtil(node, 1, &max_level);
}

Time Complexity : O(n)
Space Complexity : O(1) if you don’t consider stack space utilized by Recursion.

 

 

Nissan qashqai acenta 1.6 dci, Swot ford fiesta, Volkswagen golf variant diesel 2009

Similar Articles

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Binary Tree, tree

Reader Interactions

Trackbacks

  1. VMWare SDEII Interview | GoHired says:
    July 24, 2016 at 5:33 pm

    […] Right View of a Binary Tree, its edge cases and failing cases to handle in code Solution : http://gohired.in/2016/07/24/right-view-of-binary-tree/ […]

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Convert number to words java

Trie Dictionary

Sort an array according to the order defined by another array

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

25 horses 5 tracks Find 3 fastest puzzle

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

How Radix sort works

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Cisco Hiring Event 21st – 22nd Feb 2015

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

C++ OOPs Part2

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Best Java Book | Top Java Programming Book for Beginners

HackeEarth Flipkart’s Drone

Find Pythagorean Triplets in an array in O(N)

Test Cases for Round Function

SAP Off Campus Hiring_ March 2015 Verbal Skills

Minimum insertions to form a palindrome

Find the smallest window in a string containing all characters of another string

Mirror of Tree

Python List

LeetCode: Binary Tree Maximum Path Sum

Hackerearth : Counting Subarrays

Wrong Directions given find minimum moves so that he can reach to the destination

How strtok() Works

Given a string, find the first character which is non-repetitive

Closed Parentheses checker

Interfaces in C++ (Abstract Classes in C++)

C Program for TAIL command of UNIX

Copyright © 2025 · Genesis Framework · WordPress · Log in