235. 二叉搜索树的最近公共祖先 + 701. 二叉搜索树中的插入操作 + 450. 删除二叉搜索树中的节点

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

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root == NULL || root == p || root == q) return root;

        TreeNode* right;
        TreeNode* left;
        if(root -> val > p -> val && root -> val > q -> val) 
        left = lowestCommonAncestor(root -> left , p , q);
        else if( root -> val < p -> val && root -> val < q -> val)
        right = lowestCommonAncestor(root -> right , p, q);
        else return root;


        if(right == NULL && left != NULL) return left;
        else return right;
    }
};

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

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* insertIntoBST(TreeNode* root, int val) {
        TreeNode* newnode = new TreeNode(val);
        TreeNode* cur = root;
        if(root == NULL) return newnode;
        while(cur -> left || cur -> right)
        {
            if(cur -> val > val && cur -> left == NULL) 
            {
                break;
            }
            else if(cur -> val > val) 
            {
                cur = cur -> left;
            }
            else if(cur -> val < val && cur -> right == NULL) 
            {
                break;
            }
            else
            {
                cur = cur -> right;
            }
        }
        if(val > cur-> val) cur -> right = newnode;
        else cur -> left = newnode;
        return root;
    }
};

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

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
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)
            {
                delete root;
                return NULL;
            }
            else if(root -> left != NULL && root -> right == NULL)
            {
                TreeNode* node = root -> left;
                delete root;
                return node;
            }
            else if(root -> left == NULL && root -> right != NULL)
            {
                TreeNode* node = root -> right;
                delete root;
                return node;
            }
            else
            {
                TreeNode* node = root -> left;
                while(node -> right)
                {
                    node = node -> right;
                }
                node -> right = root -> right;
                TreeNode* temp = root;
                root = root -> left;
                delete temp;
                return root;
            }
        }
        else if(root -> val > key) root -> left = deleteNode(root -> left , key);
        else root -> right = deleteNode(root -> right , key);
        return root;

    }
};