Package g0601_0700.s0687_longest_univalue_path

Class Solution

java.lang.Object

g0601_0700.s0687_longest_univalue_path.Solution

public class Solution
extends Object

687 - Longest Univalue Path.<p>Medium</p> <p>Given the <code>root</code> of a binary tree, return <em>the length of the longest path, where each node in the path has the same value</em>. This path may or may not pass through the root.</p> <p><strong>The length of the path</strong> between two nodes is represented by the number of edges between them.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/10/13/ex1.jpg" alt="" /></p> <p><strong>Input:</strong> root = [5,4,5,1,1,5]</p> <p><strong>Output:</strong> 2</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/10/13/ex2.jpg" alt="" /></p> <p><strong>Input:</strong> root = [1,4,5,4,4,5]</p> <p><strong>Output:</strong> 2</p> <p><strong>Constraints:</strong></p> <ul> <li>The number of nodes in the tree is in the range <code>[0, 10⁴]</code>.</li> <li><code>-1000 <= Node.val <= 1000</code></li> <li>The depth of the tree will not exceed <code>1000</code>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	longestUnivaluePath(TreeNode root)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

longestUnivaluePath

public int longestUnivaluePath(TreeNode root)