Perfect Binary Tree Check
You are given the root of a binary tree. A tree is perfect if every node that is not a leaf has two children and all the leaves are on the same level. Return True if the tree is perfect, otherwise False. An empty tree is perfect.
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,6,7]
returns true
Three full levels.
Example 2
root [1,2,3,4]
returns false
3 is a leaf above the level of 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.