diameter-of-binary-tree

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the <code>root</code> 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 <code>root</code>.

The length of a path between two nodes is represented by the number of edges between them.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/06/diamtree.jpg" style="width: 292px; height: 302px;" />
<pre>
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].
</pre>

Example 2:

<pre>
Input: root = [1,2]
Output: 1
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[1, 104]</code>.</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
</ul>

diameterOfBinaryTree

Diameter of Binary Tree

Diameter of N-Ary Tree

diameter-of-n-ary-tree

N 叉树的直径

Longest Path With Different Adjacent Characters

longest-path-with-different-adjacent-characters

相邻字符不同的最长路径

Tree

Depth-First Search

Binary Tree

给你一棵二叉树的根节点，返回该树的 直径 。

二叉树的 直径 是指树中任意两个节点之间最长路径的 长度 。这条路径可能经过也可能不经过根节点 <code>root</code> 。

两节点之间路径的 长度 由它们之间边数表示。

&nbsp;

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/06/diamtree.jpg" style="width: 292px; height: 302px;" />
<pre>
输入：root = [1,2,3,4,5]
输出：3
解释：3 ，取路径 [4,2,1,3] 或 [5,2,1,3] 的长度。
</pre>

示例 2：

<pre>
输入：root = [1,2]
输出：1
</pre>

&nbsp;

提示：

<ul>
	<li>树中节点数目在范围 <code>[1, 104]</code> 内</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
</ul>