最长两个节点的路径一定会路过一个根节点加上他的子树,所以一遍dfs即可。每个点返回高度,根据返回的高度算当前节点最大值,更新全局最大值即可。
/**
* 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 getMaxHeight(TreeNode *node, int& mx)
{
if(!node->left && !node->right)return 1;
int h1 = 0, h2 = 0;
if(node->left)h1 = getMaxHeight(node->left, mx);
if(node->right)h2 = getMaxHeight(node->right, mx);
mx = max(mx, h1+h2);
return max(h1, h2)+1;
}
int diameterOfBinaryTree(TreeNode* root) {
int ans = 0;
getMaxHeight(root, ans);
return ans;
}
};