Skip to content

problem10.md

Latest commit

 

History

History
11 lines (8 loc) · 342 Bytes

problem10.md

File metadata and controls

11 lines (8 loc) · 342 Bytes

Problem 10: Profile Projection

Problem Statement

Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

Input Format

  • The root of a binary tree.

Example

Input: root = [1, 2, 3, null, 5, null, 4]
Output: [1, 3, 4]