# ---
# title: 199. Binary Tree Right Side View
# id: problem199
# author: Tian Jun
# date: 2020-10-31
# difficulty: Medium
# categories: Tree, Depth-first Search, Breadth-first Search
# link: <https://leetcode.com/problems/binary-tree-right-side-view/description/>
# hidden: true
# ---
# 
# 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       <---
#     
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
