This is a small collection of data structures I have implemented in Python including a heap, binary search tree and AVL tree. I created these data types based on a series of lectures published by MIT for learning algorithms. The lectures include a discussion of how the data structures work and how different methods of implementing them will effect their computational complexity. However, the implementation is never given and so all these scripts were written without a direct reference. I also created various testing methods to ensure that my implementations operated correctly.