题目:
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
翻译:
给定一个二叉搜索树(BST),将它转换成一棵更好的树即每一个原BST的值都改变成原值加上BST中所有原值比它大的值。
例子:
输入: 二叉搜索树的根是这样的:
5
/ \
2 13
输出: 更好树的根是这样:
18
/ \
20 13
思路:
用递归的思想求解。观察发现因为题中给的是二叉搜索树,因此,所有根节点的右节点都大于根的值,所有根节点的左节点都小于根的值,因此,转换后的树的根节点是原来的根节点加上所有右节点的值得到的,而转换后的根节点的左节点即原来的左节点加转换后的根节点的值。
C++代码(Visual Studio 2017):
#include "stdafx.h"
#include <iostream>
using namespace std;
struct TreeNode {
int val;
TreeNode* left;
TreeNode* right;
TreeNode(int x) :val(x), left(NULL), right(NULL) {}
};
class Solution {
private:
int sum = 0;
public:
TreeNode* convertBST(TreeNode* root) {
if (root != NULL) {
convertBST(root->right);
sum += root->val;
root->val = sum;
convertBST(root->left);
}
return root;
}
};
int main()
{
Solution s;
TreeNode* root = new TreeNode(5);
root->left = new TreeNode(2);
root->right = new TreeNode(13);
TreeNode* result = s.convertBST(root);
cout << result->val << " " << result->left->val << " " << result->right->val << endl;
return 0;
}