Interview Guides

Binary Tree Right Side View

Medium

Hash Tablestimed codingTrees

Problem

Given the root of a binary tree, return a list of node values visible when the tree is viewed from the right side, ordered from top to bottom. The input is the root node of a binary tree, and the output is a list of integers.

Constraints

0 <= number of nodes <= 10^4
-1000 <= Node.val <= 1000
The tree may be empty
A solution close to O(n) time is expected

Problem

Constraints

0 <= number of nodes <= 10^4
-1000 <= Node.val <= 1000
The tree may be empty
A solution close to O(n) time is expected

Practice Python

Python 3.10

Open on desktop for the full Python editor with syntax highlighting and autocomplete.

Up next

Binary Tree Inorder TraversalEasy

Binary Tree Preorder TraversalMedium

Binary Tree Level Order TraversalEasy

Next question

All questions/Coding

Binary Tree Right Side View

Medium

Hash Tablestimed codingTrees

Problem

Constraints

0 <= number of nodes <= 10^4
-1000 <= Node.val <= 1000
The tree may be empty
A solution close to O(n) time is expected

Problem

Constraints

0 <= number of nodes <= 10^4
-1000 <= Node.val <= 1000
The tree may be empty
A solution close to O(n) time is expected

Practice Python

Python 3.10

Open on desktop for the full Python editor with syntax highlighting and autocomplete.

Up next

Binary Tree Inorder TraversalEasy

Binary Tree Preorder TraversalMedium

Binary Tree Level Order TraversalEasy

Next question

Binary Tree Right Side View | Dataford Interview Questions