Level Order Traversal Bottom Up
You are given the root of a binary tree. Group the values by level, left to right inside each level, but list the deepest level first and the root level last. Return a list of lists. 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 [3,9,20,null,null,15,7]
returns [[15,7],[9,20],[3]]
Levels top-down are [3], [9, 20], [15, 7]; reversed they are [15, 7], [9, 20], [3].
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.