Implementing a Stack in Python
Python Program to Implement a Stack. The program creates a stack and allows the user to perform push and pop operations on it. Create a class Stack with instance variable items initialized to an empty list.
Now that we have clearly defined the stack as an abstract data type we will turn our attention to using Python to implement the stack. Recall that when we give an abstract data type a physical implementation we refer to the implementation as a data structure.
As we described in Chapter 1, in Python, as in any object-oriented programming language, the implementation of choice for an abstract data type such as a stack is the creation of a new class. The stack operations are implemented as methods. Further, to implement a stack, which is a collection of elements, it makes sense to utilize the power and simplicity of the primitive collections provided by Python. We will use a list.
Recall that the list class in Python provides an ordered collection mechanism and a set of methods. For example, if we have the list [2,5,3,6,7,4], we need only to decide which end of the list will be considered the top of the stack and which will be the base. Once that decision is made, the operations can be implemented using the list methods such as
The following stack implementation (ActiveCode 1) assumes that the end of the list will hold the top element of the stack. As the stack grows (as
push operations occur), new items will be added on the end of the list.
pop operations will manipulate that same end.
class Stack: def __init__(self): self.__items =  def is_empty(self): return self.__items ==  def size(self): return len(self.__items) def push(self, item): self.__items.append(item) def peek(self): return self.__items[len(self.__items) - 1] def pop(self): return self.__items.pop() def __str__(self): return str(self.__items)
0 comments Comments
Leave a comment
- Basic Data Structures
- Sorting and Searching
- Trees and Tree Algorithms
- Graphs and Graph Algorithms