Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0501_0600.s0543_diameter_of_binary_tree.Solution

```
public class Solution
extends Object
```
543 - Diameter of Binary Tree.
Easy

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:

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, 10⁴].
- -100 <= Node.val <= 100

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int diameterOfBinaryTree(TreeNode root)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

diameterOfBinaryTree

public int diameterOfBinaryTree(TreeNode root)