• 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

BFS (Breath First Search)

Leetcode: Merge Intervals

Given Set of words or A String find whether chain is possible from these words or not

Python String and numbers

simple sql injection

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

Count number of ways to reach a given score in a game

Doubly linked list

Client Server C program

BlueStone E-commerce Interview Experience

Count Possible Decodings of a given Digit Sequence

Given a float number convert it into the string WITHOUT using any inbuilt Function

How Radix sort works

The Magic HackerEarth Nirvana solutions Hiring Challenge

Printing Longest Common Subsequence

C++ OOPs Part2

1014 Practice Question of New GRE – Princeton

Find if a binary tree is height balanced ?

Apriori algorithm C Code Data Mining

Connect n ropes with minimum cost

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Subset Sum Problem Dynamic programming

strtok()

Find the kth number with prime factors 3, 5 and 7

Find Percentage of Words matching in Two Strings

Stock Buy Sell to Maximize Profit

TicTacToe Game As Asked in Flipkart

HackeEarth Flipkart’s Drone

Print Power Set of a Set

Length of the longest substring without repeating characters

Copyright © 2025 · Genesis Framework · WordPress · Log in