Stack and Queue

About this app

The same sequence of push and pop on a stack and in a queue: what comes out? The inside view shows what the construction costs: as a Python list every cell moves up one by one on pop(0), the counter reaches n(n−1)/2; the list with an index keeps everything; the linked list only rewires first, last and next. Ten examples from the slides with real Python runs, including undo, bracket checking, swapped lines with a self-loop and duck typing.

Subject: Computer science

More from Computer science

• Ackermann function
• Elevator simulator
• Binary workshop
• Binary versus linear search
• The Collatz problem
• Inside a CPU
• Swap the inside
• Function rooms in 3D

A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps