Khan.randRange(1, 6) lqueueDequeuePRO.initJSAV(arr_size)

Dequeue a value from the linked queue.

First move the correct value to the box shown below the list. Then update any necessary pointers. If a pointer variable needs to be set to null, then click the pointer and then click on the "Make Null" button.

[lqueueDequeuePRO.userInput]
if (!lqueueDequeuePRO.checkAnswer(arr_size) && !guess[0]) { return ""; // User did not click, and correct answer is not // initial array state } else { return lqueueDequeuePRO.checkAnswer(arr_size); }

If there are no values on the list, then nothing can be removed. So just click "Check Answer".

The value to be removed must be in the node following the one that "front" is pointing to (that is, the second node on the list). So click that value, then click the "return" box below the list.

If there are more than two nodes on the list, then the node that "front" points to should have its pointer field changed to point to the third node.

But if there are only two nodes on the list, then the front node's pointer field must be changed to null with the "Make Null" button. And the "Rear" pointer needs to point to the first node.