这个题的难点在于遍历顺序,要采取右,中,左的遍历,遍历过程中不断累加节点数值即可。
/**
* 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:
void sumTree(TreeNode *n, int &val)
{
if(!n)return;
sumTree(n->right, val);
n->val += val;
val = n->val;
sumTree(n->left, val);
}
TreeNode* convertBST(TreeNode* root) {
int val = 0;
sumTree(root, val);
return root;
}
};