* Remove the element at the front of the queue (the head of the linked list). * If the queue is empty, return null. * @return {*}
()
| 43 | * @return {*} |
| 44 | */ |
| 45 | dequeue() { |
| 46 | const removedHead = this.linkedList.deleteHead(); |
| 47 | return removedHead ? removedHead.value : null; |
| 48 | } |
| 49 | |
| 50 | /** |
| 51 | * @param [callback] |
no test coverage detected