This tutorial will cover the stack (actually built-in), the standard queue, linked-lists, binary search trees (two ways), and the priority queue -- how to build them, navigate them, and operations that can be performed using them. The tutorial will also discuss pro's and con's of these structures including complexity theory which is a measure of how fast an operation will run with millions of items.

The tutorial will have some lecture with small examples of various Data Structures focusing on the structures that use the list (array) and then continue into the ones requiring the dynamic memory elements common to current languages. Participants will be designing classes to implement these Data Structures.

Audience: Individuals interested in learning about some common Data Structures (and some not so common) in Python. The tutorial will be in Python version 2.7. Students should be familiar with creating a class and know about recursion. No prior math level required, the complexity theory necessary for the pro's and con's part will be taught during the tutorial. Note: Complexity Theory sounds like a difficult topic, it is not. It is easy to use and understand. Everything should be usable in Python 3.x.