algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-05 00:25:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

Added English README

Browse Source
This commit is contained in:
Breno Baptista
2021-07-19 22:42:27 -03:00
parent 8c1235bdf1
commit 8b41ad38d3
1 changed files with 31 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
leetcode/0543.Diameter-of-Binary-Tree/README.md Normal file
View File

@ -0,0 +1,31 @@
# [543. Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)
## 题目
Given the `root` of a binary tree, return the length of the **diameter** of the tree.
The **diameter** of a binary tree is the **length** of the longest path between any two nodes in a tree. This path may or may not pass through the `root`.
The **length** of a path between two nodes is represented by the number of edges between them.
**Example 1:**
![https://assets.leetcode.com/uploads/2021/03/06/diamtree.jpg](https://assets.leetcode.com/uploads/2021/03/06/diamtree.jpg)
```
Input: root = [1,2,3,4,5]
Output: 3
Explanation: 3 is the length of the path [4,2,1,3] or [5,2,1,3].
```
**Example 2:**
```
Input: root = [1,2]
Output: 1
```
**Constraints:**
- The number of nodes in the tree is in the range `[1, 104]`.
- `-100 <= Node.val <= 100`