Day20: 二叉树基础 VII

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

给定一个二叉搜索树, 找到该树中两个指定节点的最近公共祖先。

百度百科中最近公共祖先的定义为：“对于有根树 T 的两个结点 p、q，最近公共祖先表示为一个结点 x，满足 x 是 p、q 的祖先且 x 的深度尽可能大（一个节点也可以是它自己的祖先）。”

function lowestCommonAncestor(root: TreeNode | null, p: TreeNode | null, q: TreeNode | null): TreeNode | null {
    let pVal = p.val;
    let qVal = q.val;
    if(pVal > qVal) [pVal, qVal] = [qVal, pVal];
    function traverse(root: TreeNode | null){
        if(!root) return null;
        if(root.val >= pVal && root.val <= qVal) return root;
        if(root.val > qVal) return traverse(root.left);
        else return traverse(root.right);
    }
    return traverse(root);
};

官方题解：

function lowestCommonAncestor(root: TreeNode | null, p: TreeNode | null, q: TreeNode | null): TreeNode | null {
    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;
};

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

function insertIntoBST(root: TreeNode | null, val: number): TreeNode | null {
    if (!root) return new TreeNode(val);
    let pointer = root;
    let pointer2: TreeNode | null = null;
    while (pointer !== null) {
        while (pointer && pointer.val > val) {
            pointer2 = pointer;
            pointer = pointer.left;
        }
        while (pointer && pointer.val < val) {
            pointer2 = pointer;
            pointer = pointer.right;
        }
    }
    if(pointer2.val > val){
        pointer2.left = new TreeNode(val);
    } else {
        pointer2.right = new TreeNode(val);
    }
    return root;
};

官方题解：

递归-有返回值

function insertIntoBST(root: TreeNode | null, val: number): TreeNode | null {
    if (root === null) return new TreeNode(val);
    if (root.val > val) {
        root.left = insertIntoBST(root.left, val);
    } else {
        root.right = insertIntoBST(root.right, val);
    }
    return root;
};

450.删除二叉搜索树中的节点 （需要回看）

function deleteNode(root: TreeNode | null, key: number): TreeNode | null {
    if(!root) return null;
    if (root.val === key) {
        if (root.left) {
            let pointer1 = root.left;
            while (pointer1.right !== null) {
                pointer1 = pointer1.right;
            }
            pointer1.right = root.right;
            root = root.left;
        } else {
            root = root.right;
        }
        return root;
    }
    if(root.val > key) root.left = deleteNode(root.left, key);
    if(root.val < key) root.right = deleteNode(root.right, key);
    return root;
};