害,学到现在还不知道累加树是啥,真就学了个寂寞呗
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int sum=0;//一定要是全局变量,如果在main函数中定义,递归将重复给sum一个初始值
TreeNode* convertBST(TreeNode* root)
{
if(root!=NULL)
{
convertBST(root->right);
sum+=root->val;
root->val=sum;
convertBST(root->left);
}
return root;
}
};