C++ | Leetcode C++题解之第538题把二叉搜索树转换为累加树
题目: 题解: class Solution { public:TreeNode* getSuccessor(TreeNode* node) {TreeNode* succ node->right;while (succ->left ! nullptr && succ->left ! node) {succ succ->left;}return succ;}TreeNode* convertBST(TreeNo…
2025-06-26