ITI 1521 Lecture Notes - List Of Data Structures, Abstract Data Type, Stack Trace

• School: University of Ottawa
• Department: Information Technology
• Course: ITI 1521
• Professor: Nathalie J.

Document Summary

A stack is a linear data structure that is always accessed from the same extremity, one element at a time, and that element is called the top of the stack. Push: add an element onto the top of the stack; Empty: tests if the stack is empty. public interface stack { public abstract boolean isempty(); public abstract e push(e o); public abstract e pop(); //returns the object at the top of this stack without removing it public abstract e peek(); There are two popular families of implementation techniques. Each time an element is pushed onto the stack, the value of the index top is incremented by one, the new element is added at that position. It avoids copying the elements up or down for each insertion or removal. Copying elements would become progressively more expensive as the number of elements in the stack. public boolean isempty() { return top==0; public void push (e element) {