data-structure-algebra/circularly-linked-list

import assert from 'assert';

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

/**
 * Removes last {@link Node} from a list. Throws if input list is empty.
 *
 * @param {Node} x First node.
 * @return {[Node, Node]} New list (possibly null) and removed node.
 */
export default function pop(x) {
    if (x === null) throw new Error('input list is empty');
    assert(x instanceof Node);
    const node = x.prev;
    return [_pop(x), node];
}