How should I practice Binary Tree Right View?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Pinecone online assessment problems in FastPrep.

Is Binary Tree Right View associated with Pinecone?

FastPrep tags this as a Pinecone online assessment coding practice problem when the problem catalog has that company and stage context.

Binary Tree Right View

Pinecone● MediumFULLTIMEOA

Learn

Problem statement

Given the root of a binary tree, imagine viewing the tree from its right side.

Return the value of the visible node at each depth, ordered from the root level downward. Return an empty array for an empty tree.

Function

rightSideView(root: TreeNode) → int[]

Examples

Example 1

root = [1,2,3,null,5,null,4]return = [1,3,4]

The rightmost values at successive depths are 1, 3, and 4.

Example 2

root = [1,null,3]return = [1,3]

The right child is visible below the root.

Example 3

root = []return = []

An empty tree has no visible levels.

Constraints

The tree contains between 0 and 10000 nodes.
-10^9 <= Node.val <= 10^9.