/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
int max;
void ergodic(struct TreeNode* root){
if(root->left){
ergodic1(root->left,root->val);
}
if(root->right){
ergodic1(root->right,root->val);
}
if(root->left){
ergodic(root->left);
}
if(root->right){
ergodic(root->right);
}
}
void ergodic1(struct TreeNode* root,int parent){
if(abs(parent-root->val)>max){
max=abs(parent-root->val);
}
if(root->left){
ergodic1(root->left,parent);
}
if(root->right){
ergodic1(root->right,parent);
}
}
int maxAncestorDiff(struct TreeNode* root){
max=0;
ergodic(root);
return max;
}
力扣------节点与其祖先之间的最大差值
最新推荐文章于 2024-07-25 21:13:04 发布