Given a binary tree, find the length of the longest path where each node in the path has the same value. This path may or may not pass through the root.
The length of path between two nodes is represented by the number of edges between them.
Example 1:
Input:
5
/ \
4 5
/ \ \
1 1 5
Output: 2
Example 2:
Input:
1
/ \
4 5
/ \ \
4 4 5
Output: 2
Note: The given binary tree has not more than 10000 nodes. The height of the tree is not more than 1000.
Related Topics:
Tree, Recursion
Similar Questions:
// OJ: https://leetcode.com/problems/longest-univalue-path/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(H)
class Solution {
int ans = 0;
int dfs(TreeNode *root) {
if (!root) return 0;
int left = dfs(root->left), right = dfs(root->right);
if (root->left && root->left->val == root->val) ++left;
else left = 0;
if (root->right && root->right->val == root->val) ++right;
else right = 0;
ans = max(ans, left + right);
return max(left, right);
}
public:
int longestUnivaluePath(TreeNode* root) {
dfs(root);
return ans;
}
};