235. 二叉搜索树的最近公共祖先
递归
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if (root->val > p->val && root->val > q->val)
return lowestCommonAncestor(root->left, p, q);
if (root->val < p->val && root->val < q->val)
return lowestCommonAncestor(root->right, p, q);
return root;
}
};
迭代
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
TreeNode* curr = root;
while (curr) {
if (curr->val > p->val && curr->val > q->val)
curr = curr->left;
else if (curr->val < p->val && curr->val < q->val)
curr = curr->right;
else
break;
}
return curr;
}
};
701.二叉搜索树中的插入操作
class Solution {
public:
TreeNode* insertIntoBST(TreeNode* root, int val) {
if (root == nullptr) {
root = new TreeNode(val);
return root;
}
if (root->val < val)
root->right = insertIntoBST(root->right, val);
if (root->val > val)
root->left = insertIntoBST(root->left, val);
return root;
}
};
450.删除二叉搜索树中的节点
这一题比插入操作要难,因为会改变二叉搜索树的结构,并且不能违反二叉搜索树的特性。
当root就是要删除的元素时,分为3种情况:
- root是叶子节点,返回null
- root只有左子树或右子树,返回左子树或右子树
- root左右子树都不为空。将root左子树移到右子树的最左端,返回右子树。
递归处理左子树和右子树。
class Solution {
public:
TreeNode* deleteNode(TreeNode* root, int key) {
if (root == nullptr)
return nullptr;
if (root->val == key) {
if (root->left == nullptr && root->right == nullptr)
return nullptr;
else if (root->left != nullptr && root->right == nullptr)
return root->left;
else if (root->left == nullptr && root->right != nullptr)
return root->right;
else {
TreeNode* tmp = root->right;
while (tmp->left) {
tmp = tmp->left;
}
tmp->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;
}
};