A collection of data structure implementations in python.
- Binary Search Tree - Stores keys in sorted order, where each left child is less than it's parent and each right child is greater than it. Values already found in the tree are not re-added. Includes insert, contains, size, depth, balance, and delete methods.
- Includes four traversal methods:
- In order
- Pre-order
- Post-order
- Breadth first
- Implements manual and self-balancing (AVL method)
- Includes four traversal methods:
##Resources
Binary Search Tree Wiki
AVL Tree Self-Balancing
##Collaborators
Constantine Hatzis
Henry Howes