/**
* 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 height(TreeNode* root, int & rst){
if(root == nullptr)
return 0;
int ld =height(root->left, rst), rd = height(root->right, rst);
rst = max(rst,ld + rd);
return 1 + max(ld,rd);
}
int diameterOfBinaryTree(TreeNode* root) {
if(root == nullptr)
return 0;
int rst = 0;
height(root, rst);
return rst;
}
};
Leetcode 543. 二叉树的直径
最新推荐文章于 2024-07-21 15:36:00 发布