今日记录
235.二叉搜索树的最近公共祖先
class Solution {
private:
TreeNode* traversal(TreeNode* cur, TreeNode* p, TreeNode* q) {
if (cur == NULL)
return NULL;
if (cur->val > p->val && cur->val > q->val) {
TreeNode* left = traversal(cur->left, p, q);
if (left != NULL) {
return left;
}
}
if (cur->val < p->val && cur->val < q->val) {
TreeNode* right = traversal(cur->right, p, q);
if (right != NULL) {
return right;
}
}
return cur;
}
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
return traversal(root, p, q);
}
};
701.二叉搜索树中的插入操作
class Solution {
public:
TreeNode* insertIntoBST(TreeNode* root, int val) {
if (root == NULL) {
TreeNode* node = new TreeNode(val);
return node;
}
if (root->val > val)
root->left = insertIntoBST(root->left, val);
if (root->val < val)
root->right = insertIntoBST(root->right, val);
return root;
}
};
450.删除二叉搜索树中的节点
动画参考:动画参考
class Solution {
public:
TreeNode* deleteNode(TreeNode* root, int key) {
if (root == NULL)
return root;
if (root->val == key) {
if (root->left == NULL && root->right == NULL) {
delete root;
return nullptr;
} else if (root->left == NULL)
return root->right;
else if (root->right == NULL)
return root->left;
else {
TreeNode* cur = root->right; // 找到右子树最左面的节点
while (cur->left != NULL) {
cur = cur->left;
}
cur->left = root->left;
TreeNode* tmp = root; // 保存root节点
root = root->right; // 删除节点
delete tmp;
return root;
}
}
if (root->val > key)
root->left = deleteNode(root->left, key);
if (root->val < key)
root->right = deleteNode(root->right, key);
return root;
}
};