108.将有序数组转换为二叉搜索树
题目链接:108. 将有序数组转换为二叉搜索树 - 力扣(LeetCode)
题解:
本题依旧是使用了递归法,递归三部曲
(1):确定递归函数返回值以及参数
TreeNode* traversal(vector<int>& nums, int left, int right)
(2):确定递归终止条件
当left > right 的时候就是空节点。
if (left > right) return nullptr;
(3):确定单层递归的逻辑
int mid = left + ((right - left)/2);
TreeNode* root = new TreeNode(nums[mid]);
root->left = traversal(nums. left, mid -1);
root->right = traversal(nums, mid + 1, right);
return root;
总结C++代码如下:
class Solution {
private:
TreeNode* traversal(vector<int>& nums, int left, int right) {
if (left > right) return nullptr;
int mid = left + ((right - left) / 2);
TreeNode* root = new TreeNode(nums[mid]);
root->left = traversal(nums, left, mid - 1);
root->right = traversal(nums, mid + 1, right);
return root;
}
public:
TreeNode* sortedArrayToBST(vector<int>& nums) {
TreeNode* root = traversal(nums, 0, nums.size() - 1);
return root;
}
};
538.把二叉搜索树转换为累加树
题目链接:538. 把二叉搜索树转换为累加树 - 力扣(LeetCode)
C++代码
class Solution {
private:
int pre = 0; // 记录前一个节点的数值
void traversal(TreeNode* cur) { // 右中左遍历
if (cur == NULL) return;
traversal(cur->right);
cur->val += pre;
pre = cur->val;
traversal(cur->left);
}
public:
TreeNode* convertBST(TreeNode* root) {
pre = 0;
traversal(root);
return root;
}
};