/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int re=0;
int maxDepth(TreeNode* root)
{
if(root==NULL)
{
return 0;
}
int left=maxDepth(root->left);
int right=maxDepth(root->right);
re=max(re,left+right);
return max(left,right)+1;
}
int diameterOfBinaryTree(TreeNode* root)
{
maxDepth(root);
return re;
}
};
Leetcode——543. 二叉树的直径
最新推荐文章于 2022-12-23 13:39:42 发布