原题链接:Leecode 543. 二叉树的直径
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int res=1;
int height(TreeNode* root)
{
if(!root) return 0;
int l=height(root->left);
int r=height(root->right);
res=max(res,l+r+1);
return max(l,r)+1;
}
int diameterOfBinaryTree(TreeNode* root) {
height(root);
return res-1;
}
};