题目描述链接:https://leetcode-cn.com/problems/convert-bst-to-greater-tree/
总体思路:反序中序中序遍历,实现。头一次做这样的题,感觉思路的转换比较重要,故而记录一下。
解题C++参考代码如下:
/** * 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: int sum; TreeNode* convertBST(TreeNode* root) { if(root){ convertBST(root->right); sum+=root->val; root->val=sum; convertBST(root->left); } return root; } };