ctci4.1
int highAve(struct tree* root){
if(root == NULL)
return 0 ;
int lefthigh = highAve(root->left);
int righthigh = highAve(root->right);
if(abs(lefthigh - righthigh) >=2 )
return -1;
else
return max(lefthigh,righthigh);
}
bool isAve(struct tree* root){
if(highAve(root) == -1)
return false;
else
return true;
}
if(root == NULL)
return 0 ;
int lefthigh = highAve(root->left);
int righthigh = highAve(root->right);
if(abs(lefthigh - righthigh) >=2 )
return -1;
else
return max(lefthigh,righthigh);
}
bool isAve(struct tree* root){
if(highAve(root) == -1)
return false;
else
return true;
}
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步