Delete the Leaves Once
You are given the root of a binary tree. Remove every leaf (a node with no children) from the tree, all at the same time. Nodes that become leaves because of this stay. Return the new root. A tree that is a single node becomes empty.
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,4,5]
returns [1,2]
4, 5 and 3 are leaves and are removed: [1,2].
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.