Description
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
Solution
又是递归调用 + 两个辅助计算的函数
/**
* 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) {
if (!root) return root;
if (root->right) {
root->right = convertBST(root->right);
root->val += sum(root->right);
}
if (root->left) {
root->left = convertBST(root->left);
root->left = leftAdd(root->left, root->val);
}
return root;
}
TreeNode* leftAdd(TreeNode* root, int num) {
if(!root) return root;
root->val += num;
if (root->right) root->right = leftAdd(root->right, num);
if (root->left) root->left = leftAdd(root->left, num);
return root;
}
int sum(TreeNode* root) {
if(!root->left) return root->val;
return sum(root->left);
}
};
result:
Runtime: 44 ms, faster than 84.35% of C++ online submissions for Convert BST to Greater Tree.
Memory Usage: 23.5 MB, less than 100.00% of C++ online submissions for Convert BST to Greater Tree.
20190414 Sun
tbc