Single valued subtree
Medium Accuracy: 63.88% Submissions: 791 Points: 4

Given a binary tree, count the number of Single Valued Subtrees. A Single Valued Subtree is one in which all the nodes have same value. 

Example 1

Input :
             / \
            1   5
           / \   \
          5   5   5
Output : 4
Explanation : 
There are 4 subtrees with single values.

Example 2:

             / \
            4   5
           / \   \
          4   4   5   
Output: 5
There are five subtrees with single values.
Your task :
You don't have to read input or print anything. Your task is to complete the function singlevalued() which takes the root of the tree as input and returns the count of single valued subtrees.
Expected Time Complexity : O(n)
Expected Auxiliary Space : O(n)
Constraints :
1 <= n <= 10^5

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.

to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.

Single valued subtree

Output Window