# README
250. Count Univalue Subtrees (Medium)
Given a binary tree, count the number of uni-value subtrees.
A Uni-value subtree means all nodes of the subtree have the same value.
Example :
Input: root = [5,1,5,5,5,null,5] 5 / \ 1 5 / \ \ 5 5 5 Output: 4
Related Topics
[Tree] [Depth-First Search] [Binary Tree]
Similar Questions
- Subtree of Another Tree (Easy)
- Longest Univalue Path (Medium)