Logout

5.1.7

Construct algorithms using the access methods of a stack.

 

Teaching Note:

Access methods:

- push
- pop
- isEmpty.

LINK Connecting computational thinking and program design.


 

Sample Question:

sdfsdfsf

JSR Notes:

Below is a full movie of stacks and queues (using linked lists, which makes most sense).

THIS IS A VERY IMPORTANT MOVIE - LOTS OF STUFF IN IT
(The diagram below is just for the one thing missed.)

Loading the player...


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.

is empty function