Problem Challenge 2

Name: Grokking the Coding Interview: Patterns for Coding Questions
Author: Design Gurus

We'll cover the following

- - Right View of a Binary Tree (easy)
- - Try it yourself

Right View of a Binary Tree (easy) #

Given a binary tree, return an array containing nodes in its right view. The right view of a binary tree is the set of nodes visible when the tree is seen from the right side.

Try it yourself #

Try solving this question here:

Java

Python3

C++

from collections import deque
 
class TreeNode:
  def __init__(self, val):
    self.val = val
    self.left, self.right = None, None
 
def tree_right_view(root):
  result = []
  # TODO: Write your code here
  return result
 
def main():
  root = TreeNode(12)
  root.left = TreeNode(7)
  root.right = TreeNode(1)
  root.left.left = TreeNode(9)
  root.right.left = TreeNode(10)
  root.right.right = TreeNode(5)
  root.left.left.left = TreeNode(3)
  result = tree_right_view(root)
  print("Tree right view: ")
  for node in result:
    print(str(node.val) + " ", end='')
 
main()

Output

0.462s

Tree right view:

Mark as Completed

← Back

Solution Review: Problem Challenge 1

Solution Review: Problem Challenge 2