var queue = []; queue.add = queue.push; queue.remove = queue.shift;
Also, he is using "shift" and requires binary trees, but makes no mention whatsoever of the performance characteristics?
Also, he is using "shift" and requires binary trees, but makes no mention whatsoever of the performance characteristics?