Closed cocochrane closed 7 years ago
My suggestion is to first implement the database as an unbalanced binary search tree: basically you need to cross the t's and dot the i's on the lab. The code can be more elegant, and you must document it better, and test it extensively.
Smoke tests has been written
Okay - just added a bunch of tests. Currently we're at 99% coverage for RedBlackTree.py
Closing this issue
My suggestion is to first implement the database as an unbalanced binary search tree: basically you need to cross the t's and dot the i's on the lab. The code can be more elegant, and you must document it better, and test it extensively.