用反过来的中序遍历即可
int sum = 0;
void rever(TreeNode *root) {
if (!root) return;
rever(root->right);
root->val += sum;
sum = root->val;
rever(root->left);
}
TreeNode* convertBST(TreeNode* root) {
rever(root);
return root;
}