Stacks as Circular Lists
Let Stack be a pointer to the last node of a circular list
Let the first node represent the top of the stack
An empty stack is represented by the null list
Previous slide
Next slide
Back to first slide
View graphic version