Advanced Data Structures in Python
Basic implementation of advanced data structures in python.I usually use these for my coding problems on hackerrank, leetcode, pramp etc.
Needs to be tested for use in programming contest environment.
Implemented:
- AVL Trees
- Fenwich Trees / BIT Tree
- Balanced Binary Search Tree
To be implemented:
- Segment trees
- KDTrees
- Interval trees
- Red-Black trees
- Suffix tries
Getting started
It is not published as a package now, so just copy and paste it, import it and use it as per normal. Head on over to my repl repos to run these code in an interactive coding environment online!
https://repl.it/@thejerrytan/AdvancedDataStructures
Contributing
Implementing each one takes me a day. So please, contributors are welcome! Arigato!
Just create a PR and i will review it. We are all doing this for learning purposes, so let's all learn together!