Solution: Univalued Binary Tree
Let's solve the Univalued Binary Tree problem using the Tree Depth-First Search pattern.
We'll cover the following...
Statement
A binary tree is considered uni-valued if every node in the tree contains the same value.
Given the root of a binary tree, return TRUE if the tree is uni-valued, or FALSE otherwise.
Constraints:
The number of nodes in the tree is in the range
. ...