Construct algorithms using the access methods of a queue.


Teaching Note:

Access methods:

- enqueue
- dequeue
- isEmpty.

LINK Connecting computational thinking and program design.


Sample Question:


JSR Notes:

Below is a full movie of stacks and queues (using linked lists, which makes most sense). (This is the same one as in 5.1.7.)

Note that I don't include an isEmpty method in the video. That would test to see if the head was == to null.

And also note that more Java implementation details are expected in the OOP extension later on in the curriculum.

Loading the player...