Find All Lonely Nodes
You are given the root of a binary tree. A node is lonely if its parent has no other child (it is the only child). The root is never lonely. Return the values of all lonely nodes in level order (top to bottom, left to right). 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,4]
returns [4]
4 is the only child of 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.