Binary Tree Right Side View
You are given the root of a binary tree. Imagine standing to the right of the tree. Return the values you can see, from top to bottom: the last (rightmost) node of each level. An empty tree gives [].
Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.
Example 1
root [1,2,3,null,5,null,4]
returns [1,3,4]
Rightmost per level: 1, 3, 4.
Constraints
0 <= number of nodes <= 100-100 <= node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.