/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root
* @return {number}
*/
var diameterOfBinaryTree = function (root) {
if (root === null || (root.left === null && root.right === null)) return 0
let res = 0
function dfs(root) {
if (root === null) return 0
let left = dfs(root.left)
let right = dfs(root.right)
res = Math.max(res, left + right + 1)
return Math.max(left, right) + 1
}
dfs(root)
return res - 1
};
如希望撰写评论,请发邮件至 me@tianhegao.com (直接点击邮箱可自动跳转至默认邮箱App,并填写收信人和邮件主题)或者点击这里在线留言,我会挑选对读者有价值的评论附加到文章末尾。
可通过以下渠道赞赏此文
- 爱发电
- Paypal(定额 5 美元)