binary_tree_right_side_view

README

< Previous 　　　　　　　　　　　　　　　　 Next >

199. Binary Tree Right Side View (Medium)

Given 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.

Example:

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

   1            <---
 /   \
2     3         <---
 \     \
  5     4       <---

Related Topics

[Tree] [Depth-first Search] [Breadth-first Search]

Similar Questions

1. Populating Next Right Pointers in Each Node (Medium)
2. Boundary of Binary Tree (Medium)