Day19 二叉树专项

235. 二叉搜索树的最近公共祖先

// 搜索一条边
// 如果当前节点大于p且小于q 或 大于q且小于p，那么该节点就是待搜索节点
class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if (root == nullptr) return root;

        if (root->val > p->val && root->val > q->val) {
            return lowestCommonAncestor(root->left, p, q);
        } else if (root->val < p->val && root->val < q->val) {
            return lowestCommonAncestor(root->right, p, q);
        } 

        return root;
    }
};

701. 二叉搜索树中的插入操作

// 迭代
class Solution {
public:
    TreeNode* insertIntoBST(TreeNode* root, int val) {
        TreeNode* new_node = new TreeNode(val);
        if (root == nullptr) return new_node;

        TreeNode* cur = root;
        while(true) {
            if (val > cur->val) {
                if (cur->right == nullptr) {
                    cur->right = new_node;
                    break;
                } else {
                    cur = cur->right;
                }
            } else if (val < cur->val) {
                if (cur->left == nullptr) {
                    cur->left = new_node;
                    break;
                } else {
                    cur = cur->left;
                }
            }
        }
        return root;
    }
};

// 递归
class Solution {
public:
    void traversal(TreeNode* root, TreeNode* new_node) {
        if (root->val > new_node->val) {
            if (root->left == nullptr) {
                root->left = new_node;
                return;
            } else {
                traversal(root->left, new_node);
            }
        } else if (root->val < new_node->val) {
            if (root->right == nullptr) {
                root->right = new_node;
                return;
            } else {
                traversal(root->right, new_node);
            }
        }
    }

    TreeNode* insertIntoBST(TreeNode* root, int val) {
        TreeNode* new_node = new TreeNode(val);
        if (root == nullptr) return new_node;
        traversal(root, new_node);
        
        return root;
    }
};

// 递归，简单写法
class Solution {
public:
    TreeNode* insertIntoBST(TreeNode* root, int val) {
        if (root == nullptr) {
            TreeNode* new_node = new TreeNode(val);
            root = new_node;
            return root;
        }
        
        if (root->val > val) root->left = insertIntoBST(root->left, val);
        if (root->val < val) root->right = insertIntoBST(root->right, val);
        
        return root;
    }
};

450. 删除二叉搜索树中的节点

// 1. 找到待删除节点，需要记录待删除节点的父节点
// 2. 处理以待删除节点为根节点的子树，保证其二叉搜索树的性质
class Solution {
public:
    TreeNode* deleteNode(TreeNode* root, int key) {
        // 1. 没找到待删除节点
        if (root == nullptr) return root;

        // 2. 找到待删除节点
        if (root->val == key) {
            if (root->left == nullptr && root->right == nullptr) {
                // 2.1 待删除节点为叶子结点
                delete root;
                return nullptr;
            } else if (root->left == nullptr && root->right != nullptr) {
                // 2.2 待删除节点无左孩子，有右孩子
                TreeNode* ret_node = root->right;
                delete root;
                return ret_node;
            } else if (root->left != nullptr && root->right == nullptr) {
                // 2.3 待删除节点有左孩子，无右孩子
                TreeNode* ret_node = root->left;
                delete root;
                return ret_node;
            } else {
                // 2.4 待删除节点有左孩子，有右孩子。
                // 将待删除节点的左子树拼接到右子树最左侧的节点上
                TreeNode* tmp = root->right;
                while (tmp->left) {
                    tmp = tmp->left;
                }

                tmp->left = root->left;

                TreeNode* del_node = root;
                root = root->right; // 必须在 delete 之前
                delete del_node;
                return root;
            }
        }

        if (root->val > key) root->left = deleteNode(root->left, key);
        if (root->val < key) root->right = deleteNode(root->right, key);

        return root;
    }
};