235. 二叉搜索树的最近公共祖先
class Solution {
TreeNode* result;
public:
void dfs(TreeNode* node, TreeNode* p, TreeNode* q){
if(!node) return ;
if(node->val>=p->val && node->val<=q->val && result == NULL){
result = node;
}
if(node->val<=p->val && node->val>=q->val && result == NULL){
result = node;
}
dfs(node->left, p,q);
dfs(node->right, p,q);
}
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
dfs(root, p, q);
return result;
}
};
参考文章:代码随想录-235. 二叉搜索树的最近公共祖先
701.二叉搜索树中的插入操作
class Solution {
public:
TreeNode* insertIntoBST(TreeNode* root, int val) {
TreeNode* node = new TreeNode(val);
TreeNode* temp = root;
if(!temp) return node;
while(temp){
if(temp->val > val){
if(temp->left) temp = temp->left;
else{
temp->left = node;
break;
}
}
else if(temp->val < val){
if(temp->right) temp = temp->right;
else{
temp->right = node;
break;
}
}
else return nullptr;
}
return root;
}
};
参考文章:代码随想录-701.二叉搜索树中的插入操作
450.删除二叉搜索树中的节点
class Solution {
public:
TreeNode* deleteNode(TreeNode* root, int key) {
if(root == nullptr){
return root;
}
if(root->val == key){
if(root->right == nullptr){
return root->left;
}
TreeNode* tmp = root->right;
while(tmp->left){
tmp = tmp->left;
}
swap(root->val, tmp->val);
}
root->left = deleteNode(root->left, key);
root->right = deleteNode(root->right, key);
return root;
}
};
参考文章:代码随想录-450.删除二叉搜索树中的节点