Univalued Binary Tree
You are given the root of a binary tree. Return True if every node in the tree has the same value as the root, otherwise False. An empty tree counts as True.
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,1,1,1,1,null,1]
returns true
All values are 1.
Example 2
root [2,2,2,5,2]
returns false
One node holds 5.
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.