UnivaluedBinaryTree

Published at 2022-11-16

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def isUnivalTree(self, root: Optional[TreeNode]) -> bool:
        target = root.val
        
        def isSame(root):
            if not root:
                return True
            
            if root.val == target:
                return isSame(root.left) and isSame(root.right)
            else:
                return False
        
        
        
        return isSame(root)