leetcode 1038. Binary Search Tree to Greater Sum Tree

本文主要是介绍leetcode 1038. Binary Search Tree to Greater Sum Tree，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

leetcode 1038. Binary Search Tree to Greater Sum Tree

题意：看题目。

代码：

/*** 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* bstToGst(TreeNode* root) {if(root == nullptr) return root;int sum = 0;dfs(root,sum);return root;}void dfs(TreeNode* root,int& sum){if(root == nullptr)return ;dfs(root->right,sum);sum += root->val;root->val = sum;dfs(root->left,sum);return ;}
};

 

这篇关于leetcode 1038. Binary Search Tree to Greater Sum Tree的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---