hacktoberfest
Repository metrics
- Stars
- (0 個のスター)
- PR merge metrics
- (PR metrics pending)
説明
Given the root of a binary tree, return the diameter of the tree, which is the length of the longest path between any two nodes. This path can pass through the root but doesn't have to.
The length of a path between two nodes is defined by the number of edges connecting them. leetcode