binary-search-tree/red-black-tree

import assert from 'assert';

import Node from '../types/Node.js';

/**
 * Replaces node <code>A</code> by node <code>B</code>.
 *
 * @param {Node} A - The node to replace.
 * @param {Node} B - The replacement node.
 */
const replace_node = (A, B) => {
    assert(A instanceof Node);
    assert(B instanceof Node);
    // We never apply replace_node on the root
    assert(A.parent !== null);

    if (A === A.parent.left) A.parent.left = B;
    else A.parent.right = B;

    B.parent = A.parent;
};

export default replace_node;