题目链接:https://leetcode-cn.com/problems/diameter-of-binary-tree/
题目如下:
/**
* 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 diameterOfBinaryTree(TreeNode* root) {
//思路:左子树的最大长度+右子树的最大长度 => 左子树的最大高度+右子树的最大高度
dfs(root);
return res;
}
int dfs(TreeNode* root){
if(!root) return 0;
int maxleft=dfs(root->left);
int maxright=dfs(root->right);
int maxlength=maxleft+maxright;
if(maxlength>res) res=maxlength;
return max(maxleft,maxright)+1;//传统的求树的最大高度
}
private:
int res=0;
};