文档链接:https://programmercarl.com/
LeetCode235.二叉搜索树的最近公共祖先
题目链接:https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/
思路:抓住二叉搜索树的特性,其左节点一定小于根节点,根节点一定小于右节点。如果当前节点的值同时大于p,q两节点的值时,说明p,q两节点的最近公共祖先一定在当前节点的左子树中,同理如果当前节点的值同时小于p,q两节点的值时,说明p,q两节点的最近公共祖先一定在当前节点的右子树中。
递归法:
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root == NULL) return NULL;
if(root->val < p->val && root->val < q->val) {
TreeNode* right = lowestCommonAncestor(root->right, p , q);
if(right != NULL) return right;
}
if(root->val > p->val && root->val > q->val) {
TreeNode* left = lowestCommonAncestor(root->left, p, q);
if(left != NULL) return left;
}
return root;
}
};
迭代法:
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
while(root) {
if(root->val > p->val && root->val > q->val) {
root = root->left;
} else if(root->val < p->val && root->val < q->val) {
root = root->right;
} else return root;
}
return NULL;
}
};
LeetCode701.二叉搜索树中的插入操作
题目链接:https://leetcode.cn/problems/insert-into-a-binary-search-tree/
思路:迭代法是我自己写出来的,不算难。递归法return node那里不太好想,这题整体上不算难。
递归法:
class Solution {
public:
TreeNode* insertIntoBST(TreeNode* root, int val) {
if(root == NULL) {
TreeNode* node = new TreeNode(val);
return node;
}
if(val < root->val) {
root->left = insertIntoBST(root->left, val);
}
if(val > root->val) {
root->right = insertIntoBST(root->right, val);
}
return root;
}
};
迭代法:
class Solution {
public:
TreeNode* insertIntoBST(TreeNode* root, int val) {
TreeNode* node = new TreeNode(val);
if(root == NULL) return node;
TreeNode* cur = root;
TreeNode* pre = NULL;
while(cur) {
pre = cur;
if(cur->val > val) {
cur = cur->left;
} else if(cur->val < val) {
cur = cur->right;
}
}
if(pre->val > val) {
pre->left = node;
} else {
pre->right = node;
}
return root;
}
};
LeetCode450.删除二叉搜索树中的节点
题目链接:https://leetcode.cn/problems/delete-node-in-a-bst/
思路:这里最关键的逻辑就是第五种情况(删除一个左右孩子都不为空的节点),这种情况一定要想清楚。
递归法:
class Solution {
public:
TreeNode* deleteNode(TreeNode* root, int key) {
if(root == NULL) return NULL;
if(root->val == key) {
if(root->left == NULL && root->right == NULL) return NULL;
else if(root->left != NULL && root->right == NULL) return root->left;
else if(root->left == NULL && root->right != NULL) return root->right;
else {
TreeNode* cur = root->right;
while(cur->left != NULL) cur = cur->left;
cur->left = root->left;
return root->right;
}
}
if(key < root->val) root->left = deleteNode(root->left, key);
if(key > root->val) root->right = deleteNode(root->right, key);
return root;
}
};
总结:有了二叉搜索树的特性可以帮我们快速判断目标节点的方向,不需要去遍历整个树。