Leetcode 199. Binary Tree Right Side View
Jan 10, 2022
[med]
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.
Example 1:
Input: root = [1,2,3,null,5,null,4]
Output: [1,3,4]Example 2:
Input: root = [1,null,3]
Output: [1,3]Example 3:
Input: root = []
Output: []Constraints:
- The number of nodes in the tree is in the range
[0, 100]. -100 <= Node.val <= 100
[Think]
- need to check all the route and track the depth on each node. Starting on the most right node.
2. check the answer list size and the current depth, if it’s equal add it into the answer list
