題目:
分析:
記錄两个最值即可,没什么意思。
代碼:
/**
* 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 ans=-1;
void f(int a,int b,TreeNode* root)
{
a=max(a,root->val);
b=min(b,root->val);
if(root->left==NULL&&root->right==NULL) {
ans=max(ans,abs(a-b));
}
if(root->left!=NULL)
{
f(a,b,root->left);
}
if(root->right!=NULL)
{
f(a,b,root->right);
}
}
int maxAncestorDiff(TreeNode* root) {
f(root->val,root->val,root);
return ans;
}
};