class Solution {
public:
int sum = 0;
TreeNode* convertBST(TreeNode* root)
{
if (root)
{
convertBST(root->right);
sum += root->val;
root->val = sum;
convertBST(root->left);
}
return root;
}
};
LeetCode538.把二叉搜索树转换为累加树
最新推荐文章于 2024-07-13 23:05:26 发布