• Home
• com.github.javadev
• leetcode-in-kotlin
• 1.21
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0601_0700.s0687_longest_univalue_path.readme.md Maven / Gradle / Ivy

687\. Longest Univalue Path

Medium

Given the `root` of a binary tree, return _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 the path** between two nodes is represented by the number of edges between them.

**Example 1:**

![](https://assets.leetcode.com/uploads/2020/10/13/ex1.jpg)

**Input:** root = [5,4,5,1,1,null,5]

**Output:** 2

**Explanation:** The shown image shows that the longest path of the same value (i.e. 5).

**Example 2:**

![](https://assets.leetcode.com/uploads/2020/10/13/ex2.jpg)

**Input:** root = [1,4,5,4,4,null,5]

**Output:** 2

**Explanation:** The shown image shows that the longest path of the same value (i.e. 4).

**Constraints:**

*   The number of nodes in the tree is in the range [0, 104].
*   `-1000 <= Node.val <= 1000`
*   The depth of the tree will not exceed `1000`.