coder_life
LeetCode Problem Solution No. 199. Binary Tree Right Side View
Question link English website: 199. Binary Tree Right Side View Chinese website: 199. Right view of binary tree Problem Description Given the rootof 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 1: Input: root = [1,2,3,null,5,null,4] Output: [1,3,4] Copy code Example 2: Input: root = [1,null,3] Output: [1,3] Copy code Example 3: Input: root = [] Output: [] Copy code Constraints: The number of node