Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.
Example:
Input: The root of a Binary Search Tree like this: 5 / \ 2 13 Output: The root of a Greater Tree like this: 18 / \ 20 13
题目大意:给出一个二叉搜索树,对于每个节点N,将大于N的节点中的数字加到N上。
解题思路:对于节点N来说,它的右子树中的所有节点都大于它,所以我们可以先处理右子树,然后处理节点N,最后处理N的左子树。
代码如下:
/**
* 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:
TreeNode* convertBST(TreeNode* root) {
int ans = 0;
traversal(root, ans);
return root;
}
private:
void traversal(TreeNode* root, int& ans) {
if(root) {
traversal(root->right, ans);
ans += root->val;
root->val = ans;
traversal(root->left, ans);
}
}
};