【Leetcode】543. Diameter of Binary Tree解题报告

求二叉树最大直径 方法1 递归法 class Solution1(object): def diameterOfBinaryTree(self, root): """ :type root: TreeNode :rtype: int """ self.res = 0 self.DFS(root) return self.re

>>阅读原文<<