LeetCode #java #day11 (1) 썸네일형 리스트형 LeetCode[day11] - Diameter of Binary Tree Given a binary tree, you need to compute 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. Note: The length of path between two nodes is represented by the number of edges between them 1. 알고리즘을 해결하기 위해서 생각한 방법 - 우선, 해당 문제는 이진 트리가 input으로 주어진다. - 이진트리란 무엇일까? 이진트리는.. 이전 1 다음
