• 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

CodeChef’ RRCOPY

Calculate price of parking from parking start end time prices

SAP Off Campus Hiring_ March 2015 Computer Skills

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

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Maximum difference between two elements s.t larger element appears after the smaller number

Closed Parentheses checker

VMWare SDEII Interview

Printing intermediate Integers between one element & next element of array

K’th Largest Element in BST when modification to BST is not allowed

Singly linked list

Generate largest number arranging a no. of given non negative integer numbers

Generic Object Oriented Stack with Template

Minimum insertions to form a palindrome

FizzBuzz Solution C C++

The greedy coins game Dynamic Programming

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Find min element in Sorted Rotated Array (With Duplicates)

System Design: Designing a LLD for Hotel Booking

Number of Islands BFS/DFS

SAP Hiring Off-Campus General Aptitude

Python Array String

Get Minimum element in O(1) from input numbers or Stack

Sort Stack in place

Maximum path sum between two leaves

Find the element that appears once others appears thrice

Find Pythagorean Triplets in an array in O(N)

Amazon Interview Experience – SDE Chennai

Find Nearest Minimum number in left side in O(n)

Maximum occurred Smallest integer in n ranges

Copyright © 2026 · Genesis Framework · WordPress · Log in