Count Univalue Subtrees is an example of tree problems. In this post we will see how we can solve in Javascript.

Problem Description

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.

For example: Given binary tree,

         / \
        1   5
       / \   \
      5   5   5

return 4.

Implementation: Please check the main.js snippet for the solution. If you have different approach in mind or have any suggestion for this implementation feel free to share in the comment below. Thanks!